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

Communications on Pure and Applied Mathematics

Volumn 59, Issue 6, 2006, Pages 797-829

  Donoho, David L ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33646365077     PISSN: 00103640     EISSN: 00103640     Source Type: Journal    
DOI: 10.1002/cpa.20132     Document Type: Article

References (30)

1. Bauschke, H. H.; Borwein, J. M. On projection algorithms for solving convex feasibility problems. SIAM Review 38 (1996), no. 3, 367-426.
2. Candès, E. J.; Romberg, J.; Tao, T. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inform. Theory, to appear.
3. Chen, S. S.; Donoho, D. L.; Saunders, M. A. Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20 (1998), no. 1, 33-61.
4. Coifman, R. R.; Meyer, Y.; Quake, S.; Wickerhauser, M. V. Signal processing and compression with wavelet packets. Progress in wavelet analysis and applications (Toulouse, 1992), 77-93. Frontières, Gif-sur-Yvette, 1993.
5. Coifman, R. R.; Wickerhauser, M.V. Entropy-based algorithms for best basis selection. IEEE Trans. Inform. Theory 38 (1992), 713-718.
6. Davidson, K. R.; Szarek, S. J. Local operator theory, random matrices and Banach spaces. Handbook of the geometry of Banach spaces, Vol. 1, 317-366. North-Holland, Amsterdam, 2001.
7. Donoho, D. L. Neighborly polytopes and sparse solutions of underdetermined linear equations. IEEE Trans. Inform. Theory, to appear.
8. 1 minimization. Proc. Natl. Acad. Sci. USA 100 (2003), no. 5, 2197-2202 (electronic).
9. Donoho, D. L.; Elad, M.; Temlyakov, V. Stable recovery of sparse overcomplete representations in the presence of noise'. IEEE Trans. Inform. Theory 52 (2006), no. 1, 6-18.
10. Donoho, D. L.; Huo, X. Uncertainty principles and ideal atomic decomposition. IEEE Trans. Inform. Theory 47 (2001), no. 7, 2845-2862.
11. Donoho, D. L.; Johnstone, I. M.; Hoch, J. C.; Stern, A. S. Maximum entropy and the nearly black object. J. Roy. Statist. Soc. Ser. B 54 (1992), no. 1, 41-81.
12. Dvoretsky, A. Some results on convex bodies and Banach spaces. Proc. Internat. Sympos. Linear Spaces (Jerusalem, 1960), 123-160. Jerusalem Academic Press, Jerusalem; Pergamon, Oxford, 1961.
13. El Karoui, N. New results about random covariance matrices and statistical applications. Doctoral dissertation, Stanford University, 2004.
14. Elad, M.; Bruckstein, A. M. A generalized uncertainty principle and sparse representation in pairs of bases. IEEE Trans. Inform. Theory 48 (2002), no. 9, 2558-2567.
15. Figiel, T.; Lindenstrauss, J.; Milman, V. D. The dimension of almost spherical sections of convex bodies. Acta Math. 139 (1977), 53-94.
16. Fuchs, J. J. On sparse representations in arbitrary redundant bases. IEEE Trans. Inform. Theory 50 (2004), no. 6, 1341-1344.
17. Gribonval, R.; Nielsen, M. Sparse representations in unions of bases. IEEE Trans. Inform. Theory 49 (2003), no. 12, 3320-3325.
18. n. Acta Math. 149 (1982), 71-85.
19. Leadbetter, R.; Lindgren, G.; Rootzén, H. Extremes and related properties of random sequences and processes. Springer, New York-Berlin, 1983.
20. Ledoux, M. The concentration of measure phenomenon. Mathematical Surveys and Monographs, 89. American Mathematical Society, Providence, R.I., 2001.
21. Mallat, S.; Zhang, Z. Matching pursuits with time-frequency dictionaries. IEEE Trans. Signal Process. 41 (1993), no. 12, 3397-3415.
22. Milman, V. D.; Schechtman, G. Asymptotic theory of finite-dimensional normed spaces. Lecture Notes in Mathematics, 1200. Springer, Berlin, 1986.
23. Natarajan, B. K. Sparse approximate solutions to linear systems. SIAM J. Comput. 24 (1995), 227-234.
24. Pisier, G. The volume of convex bodies and Banach space geometry. Cambridge Tracts in Mathematics, 94. Cambridge University Press, Cambridge, 1989.
25. Pollard, D. Empirical processes: theory and applications. NSF-CBMS Regional Conference Series in Probability and Statistics, 2. Institute of Mathematical Statistics, Hayward, Calif.; American Statistical Association, Alexandria, Va., 1990.
26. Schechtman, G. Random embeddings of Euclidean spaces in sequence spaces. Israel J. Math. 40 (1981), no. 2, 187-192.
27. n and random matrices. Amer. J. Math. 112 (1990), no. 6, 899-942.
28. Tropp, J. A. Greed is good: algorithmic results for sparse approximation. IEEE Trans. Inform. Theory 50 (2004), no. 10, 2231-2242.
29. Tropp, J. A. Just relax: convex programming methods for subset selection and sparse approximation. IEEE Trans Inform. Theory, to appear.
30. 1-norm solution and the sparsest solution. European J. Appl. Signal Process., to appear.