# For most large underdetermined systems of linear equations the minimal 1-norm solution is also the sparsest solution

```@article{Donoho2006ForML,
title={For most large underdetermined systems of linear equations the minimal 1-norm solution is also the sparsest solution},
author={D. Donoho},
journal={Communications on Pure and Applied Mathematics},
year={2006},
volume={59},
pages={797-829}
}```
• D. Donoho
• Published 2006
• Mathematics
• Communications on Pure and Applied Mathematics
• We consider linear equations y = Φx where y is a given vector in ℝn and Φ is a given n × m matrix with n 0 so that for large n and for all Φ's except a negligible fraction, the following property holds: For every y having a representation y = Φx0by a coefficient vector x0 ∈ ℝmwith fewer than ρ · n nonzeros, the solution x1of the 1-minimization problem is unique and equal to x0. In contrast, heuristic attempts to sparsely solve such systems—greedy algorithms and thresholding—perform… CONTINUE READING
2,101 Citations
Exact and Approximate Sparse Solutions of Underdetermined Linear Equations
• Mathematics, Computer Science
• SIAM J. Sci. Comput.
• 2008
• 25
• PDF
Finding a Sparse Vector in a Subspace: Linear Sparsity Using Alternating Directions
• Computer Science, Mathematics
• IEEE Transactions on Information Theory
• 2016
• 82
• PDF

#### References

SHOWING 1-10 OF 39 REFERENCES
On sparse representations in arbitrary redundant bases
• J. Fuchs
• Mathematics, Computer Science
• IEEE Transactions on Information Theory
• 2004
• 545
• PDF
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 minimization
• Computer Science, Medicine
• Proceedings of the National Academy of Sciences of the United States of America
• 2003
• 2,671
• PDF
Stable recovery of sparse overcomplete representations in the presence of noise
• Mathematics, Computer Science
• IEEE Transactions on Information Theory
• 2006
• 2,066
• PDF
Sparse representations in unions of bases
• Mathematics, Computer Science
• IEEE Trans. Inf. Theory
• 2003
• 930
• Highly Influential
• PDF
Greed is good: algorithmic results for sparse approximation
• J. Tropp
• Mathematics, Computer Science
• IEEE Transactions on Information Theory
• 2004
• 3,314
• Highly Influential
• PDF
A generalized uncertainty principle and sparse representation in pairs of bases
• Mathematics, Computer Science
• IEEE Trans. Inf. Theory
• 2002
• 600
• PDF
Sparse Approximate Solutions to Linear Systems
• B. Natarajan
• Mathematics, Computer Science
• SIAM J. Comput.
• 1995
• 2,298
• PDF
On Projection Algorithms for Solving Convex Feasibility Problems
• Computer Science, Mathematics
• SIAM Rev.
• 1996
• 1,413
• PDF