Structured matrices in unconstrained minimization methods
Contemporary mathematics
Hi-index | 0.00 |
Let $A$ be a $k \by n$ underdetermined matrix. The sparse basis problem for the row space $W$ of $A$ is to find a basis of $W$ with the fewest number of nonzeros. Suppose that all the entries of $A$ are nonzero, and that they are algebraically independent ...