For most large underdetermined systems of equations, the minimal 1-norm near-solution approximates the sparsest near-solution-Reference-Cited by-同舟云学术

For most large underdetermined systems of equations, the minimal 1-norm near-solution approximates the sparsest near-solution

Published:2006 Issue:7 Volume:59 Page:907-934
ISSN:0010-3640
Container-title:Communications on Pure and Applied Mathematics
language:en
Short-container-title:Comm. Pure Appl. Math.

Author:

Donoho David L.

Publisher

Wiley

Subject

Applied Mathematics,General Mathematics

Reference32 articles.

1. Atomic Decomposition by Basis Pursuit

2. ; ; ; Signal processing and compression with wavelet packets. Progress in wavelet analysis and applications (Toulouse, 1992), 77–93. Frontières, Gif-sur-Yvette, 1993.

3. ; Local operator theory, random matrices and Banach spaces. Handbook of the geometry of Banach spaces, Vol. 1, 317–366. North-Holland, Amsterdam, 2001.

Cited by 343 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Subspace learning via Hessian regularized latent representation learning with $${l}_{2,0}$$-norm constraint: unsupervised feature selection;International Journal of Machine Learning and Cybernetics;2024-06-21

2. A Reliable Iteration Algorithm for One-Bit Compressive Sensing on the Unit Sphere;Acta Mathematicae Applicatae Sinica, English Series;2024-04-19

3. Exploiting Time–Frequency Sparsity for Dual-Sensor Blind Source Separation;Electronics;2024-03-26

4. Classifier-based adaptive polynomial chaos expansion for high-dimensional uncertainty quantification;Computer Methods in Applied Mechanics and Engineering;2024-03

5. $\ell_{1}-\ell_{q}$ ($1<q\leq 2$) Minimization for One-Bit Compressed Sensing;IEEE Transactions on Signal Processing;2024