On Truncated-SVD-like Sparse Solutions to Least-Squares Problems of Arbitrary Dimensions
classification
💻 cs.DS
cs.NAmath.NA
keywords
solutionalgorithmsarbitrarydimensionsleast-squaresobtainedsparsevector
read the original abstract
We describe two algorithms for computing a sparse solution to a least-squares problem where the coefficient matrix can have arbitrary dimensions. We show that the solution vector obtained by our algorithms is close to the solution vector obtained via the truncated SVD approach.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.