Iteratively reweighted least squares minimization for sparse recovery

Communications on Pure and Applied Mathematics

Volumn 63, Issue 1, 2010, Pages 1-38

  Daubechies, Ingrid ^a   Devore, Ronald ^b   Fornasier, Massimo ^c   Güntürk, C Sinan ^d  

^a PRINCETON UNIVERSITY   (United States)

^b UNIVERSITY OF SOUTH CAROLINA   (United States)

^c JOHANN RADON INSTITUTE FOR COMPUTATIONAL AND APPLIED MATHEMATICS   (Austria)

^d NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77949704355     PISSN: 00103640     EISSN: 00103640     Source Type: Journal    
DOI: 10.1002/cpa.20303     Document Type: Article

References (41)

1. Baraniuk, R. G. Compressive sensing [Lecture notes]. IEEE Signal Processing Magazine 24 (2007), no. 4, 118-121.
2. Baraniuk, R.; Davenport, M.; DeVore, R.; Wakin, M. B. A simple proof of the restricted isometry property for random matrices (aka "The Johnson-Lindenstrauss lemma meets compressed sensing"). Constr. Approx. 28 (2008), no. 3, 253-263.
3. Byrd, R.; Payne, D. Convergence of the IRLS algorithm for robust regression. Technical Report 313, John Hopkins University, 1979.
4. Candès, E. J. Compressive sampling. International Congress of Mathematicians. Vol. III, 1433-1452. European Mathematical Society, Zürich, 2006.
5. Candès, E. J. Lecture notes of the IMA course on Compressive Sampling and Frontiers in Signal Processing, June 4-15, 2007. Available at: http://www.ima.umn.edu/2006-2007/ND6.4-15.07/abstracts.html.
6. Candès, E. J.; Romberg, J.; Tao, T. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inform. Theory 52 (2006), no. 2, 489-509.
7. Candès, E. J.; Romberg, J. K.; Tao, T. Stable signal recovery from incomplete and inaccurate measurements. Comm. Pure Appl. Math. 59 (2006), no. 8, 1207-1223.
8. Candès, E. J.; Tao, T. Decoding by linear programming. IEEE Trans. Inform. Theory 51 (2005), no. 12, 4203-4215.
9. Candès, E. J.; Tao, T. Near-optimal signal recovery from random projections: universal encoding strategies? IEEE Trans. Inform. Theory 52 (2006), no. 12, 5406-5425.
10. Candès, E. J.; Wakin, M. B.; Boyd, S. P. Enhancing sparsity by reweighted l1 minimization. J. Fourier Anal. Appl. 14 (2008), no. 5-6, 877-905.
11. Chambolle, A.; Lions, P.-L. Image recovery via total variation minimization and related problems. Numer. Math. 76 (1997), no. 2, 167-188.
12. Chartrand, R. Exact reconstructions of sparse signals via nonconvex minimization. IEEE Signal Process. Lett. 14 (2007), no. 10, 707-701.
13. Chartrand, R. Nonconvex compressive sensing and reconstruction of gradient-sparse images: random vs. tomographic Fourier sampling. IEEE International Conference on Image Processing (ICIP) 2008. Available at: http://math.lanl.gov/TUKEKL+MT2SYT.-1.CANrick/Publications/chartrand-2008-nonconvex.shtml.
14. Chartrand, R.; Staneva, V. Restricted isometry properties and nonconvex compressive sensing. Inverse Problems 24 (2008), no. 035020, 1-14.
15. Chartrand, R.; Yin, W. Iteratively reweighted algorithms for compressive sensing. Proceedings of the 33rd IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), 2008. Available at: http://math.lanl.gov/(rick/Publications/chartrand-2008-iteratively.shtml.
16. Chen, S. S.; Donoho, D. L.; Saunders, M. A. Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20 (1998), no. 1, 33-61 (electronic).
17. Claerbout, J. F.; Muir, F. Robust modeling with erratic data. Geophysics 38 (1973), no. 5, 826-844.
18. Cline, A. K. Rate of convergence of Lawson's algorithm. Math. Comp. 26 (1972), 167-176.
19. Cohen, A.; Dahmen, W.; DeVore, R. Compressed sensing and best k-term approximation. J. Amer. Math. Soc. 22 (2009), no. 1, 211-231.
20. DeVore, R. A. Nonlinear approximation. Acta Numer. 7 (1998), 51-150.
21. Donoho, D. L. Compressed sensing. IEEE Trans. Inform. Theory 52 (2006), no. 4, 1289-1306.
22. Donoho, D. L. High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension. Discrete Comput. Geom. 35 (2006), no. 4, 617-652.
23. Donoho, D. L.; Logan, B. F. Signal recovery and the large sieve. SIAM J. Appl. Math. 52 (1992), no. 2, 577-591.
24. Donoho, D. L.; Stark, P. B. Uncertainty principles and signal recovery. SIAM J. Appl. Math. 49 (1989), no. 3, 906-931.
25. Donoho, D. L.; Tanner, J. Sparse nonnegative solution of underdetermined linear equations by linear programming. Proc. Natl. Acad. Sci. USA 102 (2005), no. 27, 9446-9451 (electronic).
26. Donoho, D. L.; Tanner, J. Counting faces of randomly projected polytopes when the projection radically lowers dimension. J. Amer. Math. Soc. 22 (2009), no. 1, 1-53.
27. 1-norm minimization problems when the solution may be sparse. IEEE Trans. Inform. Theory 54 (2008), no. 11, 4789-4812.
28. Figueiredo, M. A. T.; Bioucas-Dias, J. M.; Nowak, R. D. Majorization-minimization algorithms for wavelet-based image restoration. IEEE Trans. Image Process. 16 (2007), no. 12, 2980-2991.
29. Fornasier, M.; March, R. Restoration of color images by vector valued BV functions and variational calculus. SIAM J. Appl. Math. 68 (2007), no. 2, 437-460.
30. Gorodnitsky, I. F.; Rao, B. D. Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm. IEEE Trans. Signal Process. 45 (1997), no. 3, 600-616.
31. Gribonval, R.; Nielsen, M. Highly sparse representations from dictionaries are unique and independent of the sparseness measure. Appl. Comput. Harmon. Anal. 22 (2007), no. 3, 335-355.
32. Lawson, C. L. Contributions to the theory of linear least maximum approximation. Ph.D. thesis, University of California, Los Angeles, 1961.
33. p problems. SIAM J. Optim. 3 (1993), no. 3, 609-629.
34. 1 norm deconvolution. IEEE Trans. Signal Process. 42 (1994), no. 12, 3353-3365.
35. Osborne, M. R. Finite algorithms in optimization and data analysis. Wiley Series in Probability and Mathematical Statistics: Applied Probability and Statistics. Wiley, Chichester, 1985.
36. 1-approximation. Cambridge Tracts in Mathematics, 93. Cambridge University Press, Cambridge, 1989.
37. Rudelson, M.; Vershynin, R. On sparse reconstruction from Fourier and Gaussian measurements. Comm. Pure Appl. Math. 61 (2008), no. 8, 1025-1045.
38. Saab, R.; Chartrand, R.; Yilmaz, O. Stable sparse approximations via nonconvex optimization. Proceedings of the 33rd IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), 3885-3888, ICASSP, 2008.
39. Santosa, F.; Symes, W. W. Linear inversion of band-limited reflection seismograms. SIAM J. Sci. Statist. Comput. 7 (1986), no. 4, 1307-1330.
40. 1 norm. Geophysics 44 (1979), no. 1, 39-52.
41. Tibshirani, R. Regression shrinkage and selection via the lasso. J. Roy. Statist. Soc. Ser. B 58 (1996), no. 1, 267-288.