Sparsest solutions of underdetermined linear systems via ℓq-minimization for 0 < q ≤ 1

Applied and Computational Harmonic Analysis

Volumn 26, Issue 3, 2009, Pages 395-407

  Foucart, Simon ^a   Lai, Ming Jun ^b  

^a VANDERBILT UNIVERSITY   (United States)

^b UNIVERSITY OF GEORGIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATRIXES; NUMERICAL SCHEMES;

LINEAR SYSTEMS;

EID: 62549128663     PISSN: 10635203     EISSN: 1096603X     Source Type: Journal    
DOI: 10.1016/j.acha.2008.09.001     Document Type: Article

References (16)

1. R. Baraniuk, M. Davenport, R. DeVore, M. Wakin, A simple proof of the restricted isometry property for random matrices, Constr. Approx., in press
2. Candès E.J. The restricted isometry property and its implications for compressed sensing. C. R. Acad. Sci. Sér. I 346 (2008) 589-592
3. Candès E.J., Romberg J.K., and Tao T. Stable signal recovery from incomplete and inaccurate measurements. Comm. Pure Appl. Math. 59 (2006) 1207-1223
4. Candès E.J., and Tao T. Decoding by linear programming. IEEE Trans. Inform. Theory 51 12 (2005) 4203-4215
5. Candès E.J., and Tao T. Near-optimal signal recovery from random projections: Universal encoding strategies. IEEE Trans. Inform. Theory 52 12 (2006) 5406-5425
6. 1 minimization, J. Fourier Anal. Appl., in press
7. Chartrand R. Exact reconstruction of sparse signals via nonconvex minimization. IEEE Signal Process. Lett. 14 (2007) 707-710
8. 1 minimization. Proc. Natl. Acad. Sci. USA 100 5 (2003) 2197-2202
9. Donoho D.L., Elad M., and Temlyakov V.N. Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Trans. Inform. Theory 52 (2006) 6-18
10. Gribonval R., and Nielsen M. Highly sparse representations from dictionaries are unique and independent of the sparseness measure. Appl. Comput. Harmon. Anal. 22 (2007) 335-355
11. Natarajan B.K. Sparse approximate solutions to linear systems. SIAM J. Comput. 24 (1995) 227-234
12. D. Needell, R. Vershynin, Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit, Found. Comput. Math., in press
13. Petukhov A. Fast implementation of orthogonal greedy algorithm for tight wavelet frames. Signal Process. 86 (2006) 471-479
14. Temlyakov V.N. Weak greedy algorithms. Adv. Comput. Math. 12 (2000) 213-227
15. Temlyakov V.N. Nonlinear methods of approximation. Found. Comput. Math. 3 (2003) 33-107
16. Tropp J.A. Greed is good: Algorithmic results for sparse approximation. IEEE Trans. Inform. Theory 50 (2004) 2231-2242