For a set of m vectors in $\mathbb{R}^n$ with $m>n$ is there an algorithm that finds the coefficients $\{\lambda_i\}$ not all zero such that $\lambda_1v_1+...+ \lambda_mv_m=0$?
If there is a constraint that $\lambda_i>0$ for the $i$’s used in order to get elements from the conic hull then such a combination doesn’t necessarily exist (for example if all scalar products are of the same sign) right?