Thresholds for the recovery of sparse solutions via L1 minimization

2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings

Volumn , Issue , 2006, Pages 202-206

  Donoho, David L ^a   Tanner, Jared ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF UTAH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; OPTIMIZATION; UBIQUITOUS COMPUTING;

NON-ZEROS; PROGRESS DETERMINING CONDITIONS; SPARSEST SOLUTION; SPARSITY;

LEAST SQUARES APPROXIMATIONS;

EID: 44049107024     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISS.2006.286462     Document Type: Conference Paper

References (20)

1. D. L. Donoho, "Neighborly polytopes and sparse solutions of underdetermined linear equations," IEEE. Trans. Info. Thry., 2006.
2. D. L. Donoho and J. Tanner, "Sparse nonnegative solutions of underdetermined linear equations by linear programming," Proc. Natl. Acad. Sci. USA, vol. 102, no. 27, pp. 9446-9451, 2005.
3. _, "How many random projections does one need to recover a k-sparse vector?" preprint, 2006.
4. D. L. Donoho, "Compressed sensing," IEEE. Trans. Info. Thry., 2006.
5. E. J. Candes and T. Tao, "Near optimal signal recovery from random projections and universal encoding strategies," Applied and Computational Mathematics, California Institute of Tecnology, Tech. Rep., 2004.
6. E. J. Candes, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inform. Theory, to appear.
7. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM Rev, vol. 43, no. 1, pp. 129-159, 2001
8. reprinted from SLAM J. Sci. Comput. 20 (1998), no. 1, 33-61.
9. 1 minimization," Proc. Natl. Acad. Sci. USA, vol. 100, no. 5, pp. 2197-2202 (electronic), 2003.
10. D. L. Donoho and X. Huo, "Uncertainty principles and ideal atomic decomposition," IEEE Trans. Inform. Theory, vol. 47, no. 7, pp. 2845-2862, 2001.
11. M. Elad and A. M. Bruckstein, "A generalized uncertainty principle and sparse representation in pairs of bases," IEEE Trans. Inform. Theory, vol. 48, no. 9, pp. 2558-2567, 2002.
12. J.-J. Fuchs, "On sparse representations in arbitrary redundant bases," IEEE Trans. Inform. Theory, vol. 50, no. 6, pp. 1341-1344, 2004.
13. R. Gribonval and M. Nielsen, "Sparse representations in unions of bases," IEEE Trans. Inform. Theory, vol. 49, no. 12, pp. 3320-3325, 2003.
14. J. A. Tropp, "Greed is good: algorithmic results for sparse approximation," IEEE Trans. Inform. Theory, vol. 50, no. 10, pp. 2231-2242, 2004.
15. D. L. Donoho, "High-dimensional centrally-symmetric polytopes with neighborliness proportional to dimension," Disc. Comput. Geometry, (online) Dec. 22, 2005.
16. A. M. Vershik and P. V. Sporyshev, "Asymptotic behavior of the number of faces of random polyhedra and the neighborliness problem," Selecta Math. Soviet, vol. 11, no. 2, pp. 181-201, 1992.
17. D. L. Donoho and J. Tanner, "Neighborliness of randomly-projected simplices in high dimensions," Proc. Natl. Acad. Sci. USA, vol. 102, no. 27, pp. 9452-9457, 2005.
18. M. Rudelson and R. Vershynin, "Geometric approach to errorcorrecting codes and reconstruction of signals," Department of Mathematics, University of California, Davis, Tech. Rep., 2005. [Online]. Available: http://front.math.ucdavis.edu/math.FA/0502299
19. Y M. Baryshnikov and R. A. Vitale, "Regular simplices and Gaussian samples," Discrete Comput. Geom., vol. 11, no. 2, pp. 141-147, 1994.
20. E. J. Candes and T Tao, "Decoding via linear programming," IEEE Trans. Inform. Theory, to appear.