For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- 23 March 2006
- journal article
- research article
- Published by Wiley in Communications on Pure and Applied Mathematics
- Vol. 59 (6), 797-829
- https://doi.org/10.1002/cpa.20132
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Greed is Good: Algorithmic Results for Sparse ApproximationIEEE Transactions on Information Theory, 2004
- Sparse representations in unions of basesIEEE Transactions on Information Theory, 2003
- A generalized uncertainty principle and sparse representation in pairs of basesIEEE Transactions on Information Theory, 2002
- Uncertainty principles and ideal atomic decompositionIEEE Transactions on Information Theory, 2001
- Atomic Decomposition by Basis PursuitSIAM Journal on Scientific Computing, 1998
- On Projection Algorithms for Solving Convex Feasibility ProblemsSIAM Review, 1996
- Sparse Approximate Solutions to Linear SystemsSIAM Journal on Computing, 1995
- Matching pursuits with time-frequency dictionariesIEEE Transactions on Signal Processing, 1993
- Entropy-based algorithms for best basis selectionIEEE Transactions on Information Theory, 1992
- Spaces with Large Distance to ℓ n ∞ and Random MatricesAmerican Journal of Mathematics, 1990