Iteratively Re-weighted Least Squares minimization: Proof of faster than linear rate for sparse recovery

CISS 2008, The 42nd Annual Conference on Information Sciences and Systems

Volumn , Issue , 2008, Pages 26-29

  Daubechies, Ingrid ^a   DeVore, Ronald ^b   Fornasier, Massimo ^c   Güntürk, 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

COMMUNICATION; CURVE FITTING; CYBERNETICS; DATA FUSION; EXTRACTION; INFORMATION MANAGEMENT; INFORMATION SCIENCE; LEAST SQUARES APPROXIMATIONS; OPTIMIZATION; RHENIUM; SENSOR DATA FUSION;

ANNUAL CONFERENCE; LINEAR RATE; N-MATRIX; RE-WEIGHTED LEAST SQUARES; SYSTEM OF EQUATIONS;

SOLUTIONS;

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

References (31)

1. R. Baraniuk, Compressive sensing, IEEE Signal Processing Magazine (2007).
2. R. Baraniuk, M. Davenport, R. DeVore, and M. Waken, The Johnson-Lindenstrauss lemma meets compressed sensing, (preprint).
3. E. Candès, J. Romberg, and T. Tao, Stable signal recovery from incomplete and inaccurate measurements, Comm. Pure Appl. Math. 59 (2006), no. 8, 1207-1223.
4. E. Candès and T. Tao, Near optimal signal recovery from random projections: universal encoding strategies?, IEEE Trans. Inform. Theory 52 (2006), no. 12, 5406-5425.
5. E. J. Candès, Compressive sampling, International Congress of Mathematicians. Vol. III, Eur. Math. Soc, Zürich, 2006, pp. 1433-1452.
6. E. J. Candès, J. Romberg, and T. Tao, Exact signal reconstruction from highly incomplete frequency information, IEEE Trans. Inf. Theory 52 (2006), no. 2, 489-509.
7. E. J. Candès and T. Tao, Decoding by linear programming, IEEE Trans. Inform. Theory 51 (2005), no. 12, 4203-4215.
8. E. J. Candès, M. Wakin, and S. Boyd, Enhancing sparsity by reweighted lI minimization, (Technical Report, California Institute of Technology).
9. A. Chambolle and P.-L. Lions, Image recovery via total variation minimization and related problems., Nutner. Math. 76 (1997), no. 2, 167-188.
10. S. S. Chen, D. L. Donoho, and M. A. Saunders, Atomic decomposition by basis pursuit, SIAM J. Sci. Comput. 1 (1998), 33-61, Reprint.
11. J. F. Claerbout and F. Muir, Robust modeling with erratic data, Geophysics 38 (1973), no. 5, 826-844.
12. A. K. Cline, Rate of convergence of Lawson's algorithm, Math. Comp. 26 (1972), 167-176.
13. A. Cohen, W. Dahmen, and R. DeVore, Compressed sensing and best k-term approximation, (preprint).
14. R. DeVore, Nonlinear approximation, Acta Numerica 7 (1998), 51-150.
15. D. L. Donoho, Compressed sensing, IEEE Trans. Inf. Theory 52 (2006), no. 4, 1289-1306.
16. D. L. Donoho, High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension, Discrete Comput. Geom. 35 (2006), no. 4, 617-652.
17. D. L. Donoho and B. F. Logan, Signal recovery and the large sieve, SIAM J. Appl. Math. 52 (1992), no. 2, 557-591.
18. D. L. Donoho and P. B. Stark, Uncertainty principles and signal recovery, SIAM J. Appl. Math. 49 (1989), no. 3, 906-931.
19. D. L. Donoho and J. Tanner, Sparse nonnegative solutions of underdetermined linear equations by linear programming, Proc. Nat. Acad. Sci. 102 (2005), no. 27, 9446-9451.
20. _, Counting faces of randomly-projected polytopes when the projection radically lowers dimension, preprint (2006).
21. D. L. Donoho and Y. Tsaig, Fast solution of lI-norm minimization problems when the solution may be sparse, preprint (2006).
22. M. Fornasier and R. March, Restoration of color images by vector valued BV functions and variational calculus, SIAM J. Appl. Math. 68 (2007), no. 2, 437-460.
23. R. Gribonval and M. Nielsen, Highly sparse representations from dictionaries are unique and independent of the sparseness measure, Appl. Comput. Harmon. Anal. 22 (2007), no. 3, 335-355.
24. C. L. Lawson, Contributions to the Theory of Linear Least Maximum Approximation, Ph.D. thesis, University of California, Los Angeles, 1961.
25. p problems, SIAM J. Optim. 3 (1993), no. 3, 609-629.
26. M. R. Osbome, Finite Algorithms in Optimization and Data Analysis, John Wiley & Sons Ltd., Chichester, 1985.
27. 1-Approximation, Cambridge Tracts in Mathematics, vol. 93, Cambridge University Press, Cambridge, 1989.
28. M. Rudelson and R. Vershynin, On sparse reconstruction from Fourier and Gaussian measurements, Communications on Pure and Applied Mathematics (to appear).
29. F. Santosa and W. W. Symes, Linear inversion of band-limited reflection seismograms, SIAM J. Sci. Stat. Comput. 7 (1986), no. 4, 1307-1330.
30. 44 (1979), no. 1, 39-52.
31. R. Tibshirani, Regression shrinkage and selection via the lasso, J. Roy. Statist. Soc. Ser. B 58 (1996), no. 1, 267-288.