Dynamic Updating for ℓ 1 minimization

IEEE Journal on Selected Topics in Signal Processing

Volumn 4, Issue 2, 2010, Pages 421-434

  Salman Asif, M ^a   Romberg, Justin ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

1 decoding; Compressive sensing; Dantzig selector (DS); Homotopy; LASSO; Recursive filtering; Sparse signal recovery

Indexed keywords

DANTZIG SELECTOR; HOMOTOPIES; LASSO; RECURSIVE FILTERING; SPARSE SIGNALS;

ALGORITHMS; CONVEX OPTIMIZATION; DECODING; DIELECTRIC RELAXATION; SIGNAL RECONSTRUCTION;

OPTIMIZATION;

EID: 77949720368     PISSN: 19324553     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSTSP.2009.2039174     Document Type: Article

References (39)

1. E. J. Candès and T. Tao, "Near-optimal signal recovery from random projections: Universal encoding strategies?," IEEE Trans. Inf. Theory, vol.52, no.12, pp. 5406-5425, Dec. 2006.
2. E. Candès, J. Romberg, and T. Tao, "Stable signal recovery from incomplete and inaccurate measurements," Comm. Pure Appl. Math., vol.59, no.8, pp. 1207-1223, 2006.
3. J. Tropp, "Just relax: Convex programming methods for identifying sparse signals in noise," IEEE Trans. Inf. Theory, vol.52, no.3, pp. 1030-1051, Mar. 2006.
4. D. Donoho, M. Elad, and V. Temlyakov, "Stable recovery of sparse overcomplete representations in the presence of noise," IEEE Trans. Inf. Theory, vol.52, no.1, pp. 6-18, Jan. 2006.
5. D. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol.52, no.4, pp. 1289-1306, Apr. 2006.
6. E. Candès and Y. Plan, "Near-ideal model selection by - minimization," Ann. Statist., vol. 37, no. 5A, pp. 2145-2177, 2009
7. C. Zhu, "Stable recovery of sparse signals via regularized minimization," IEEE Trans. Inf. Theory, vol.54, no.7, pp. 3364-3367, Jul. 2008.
8. E. Candès and T. Tao, "The Dantzig selector: Statistical estimation when- is much larger than-," Ann. Statist., vol.35, no.6, pp. 2313-2351, 2007.
9. E. Candès and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol.51, no.12, pp. 4203-4215, Dec. 2005.
10. M. Rudelson and R. Vershynin, "Geometric approach to error correcting codes and reconstruction of signals," Int. Math. Res. Notices, no.64, pp. 4019-4041, 2005.
11. G. Golub and C. Van Loan, Matrix Computations. Baltimore, MD: Johns Hopkins Univ. Press, 1996.
12. Å. Björck, Numerical Methods for Least Squares Problems. Philadelphia, PA: Society for Industrial Mathematics (SIAM), 1996.
13. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM J. Sci. Comput., vol.20, no.1, pp. 33-61, 1999.
14. R. Tibshirani, "Regression shrinkage and selection via the lasso," J. R. Statist. Soc., Ser. B, vol.58, no.1, pp. 267-288, 1996.
15. S.-J. Kim, K. Koh, M. Lustig, S. Boyd, and D. Gorinevsky, "An interior- point method for large-scale- -regularized least squares," IEEE J. Sel. Topics Signal Process., vol.1, no.4, pp. 606-617, Aug.. 2007.
16. M. Figueiredo, R. Nowak, and S. Wright, "Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems," IEEE J. Sel. Topics Signal Process., vol.1, no.4, pp. 586-597, Oct. 2007.
17. E. Hale, W. Yin, and Y. Zhang, "Fixed-point continuation for- -minimization: Methodology and convergence," SIAM J. Optimization, vol.19, p. 1107, 2008.
18. W. Yin, S. Osher, D. Goldfarb, and J. Darbon, "Bregman iterative algorithms for- minimization with application to compressed sensing," SIAM J. Imaging Sci., vol.1, no.1, pp. 143-168, 2008.
19. B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani, "Least angle regression," Ann. Statist., vol.32, no.2, pp. 407-499, 2004.
20. M. Osborne, B. Presnell, and B. Turlach, "A new approach to variable selection in least squares problems," IMA J. Numer. Anal., vol.20, no.3, pp. 389-403, 2000.
21. E. Candès and J. Romberg, "- -MAGIC:recovery of sparse signals via convex programming," [Online]. Available: http://www.acm. caltech. edu/l1magic/
22. G. James, P. Radchenko, and J. Lv, "The DASSO algorithm for fitting the Dantzig selector and the Lasso," J. R. Statist. Soc., Ser. B, vol.71, pp. 127-142, 2009.
23. M. S. Asif, "Primal dual pursuit: A homotopy based algorithm for the Dantzig selector," M.S. thesis, Georgia Institute of Technology, , August 2008.
24. E. J. Candès and P. A. Randall, "Highly robust error correction by convex programming," IEEE Trans. Inf. Theory, vol.54, no.7, pp. 2829-2840, 2008.
25. P. J. Garrigues and L. E. Ghaoui, "An homotopy algorithm for the Lasso with online observations," Neural Inf. Process. Syst. (NIPS), vol.21, Dec. 2008.
26. M. S. Asif and J. Romberg, "- Homotopy: A MATLAB Toolbox for homotopy algorithms in- norm minimization problems," [Online]. Available: http://users.ece.gatech.edu/~sasif/homotopy
27. D. Malioutov, M. Cetin, and A. Willsky, "Homotopy continuation for sparse signal representation," in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process., Mar. 2005, vol.5, pp. v/733-v/736.
28. D. Bertsekas, Nonlinear Programming. Belmont, MA: Athena Scientific, 1999.
29. J. Fuchs, "On sparse representations in arbitrary redundant bases," IEEE Trans. Inf. Theory, vol.50, no.6, pp. 1341-1344, 2004.
30. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, MA: Cambridge Univ. Press, Mar. 2004.
31. M. Lustig, D. Donoho, and J. Pauly, "Sparse MRI: The application of compressed sensing for rapid MR imaging," Magn. Resonance Med., vol.58, no.6, pp. 1182-1195, 2007.
32. S. F. Cotter and B. D. Rao, "Sparse channel estimation via matching pursuit with application to equalization," IEEE Trans. Commun., vol.50, no.3, pp. 374-377, Mar. 2002.
33. M. S. Asif and J. Romberg, "Streaming measurements in compressive sensing: filtering," in Proc. 42nd Asilomar Conf. Signals, Syst. Comput., Oct. 2008.
34. M. S. Asif and J. Romberg, "Dantzig selector homotopy with dynamic measurements," in Proc. IS&T/SPIE Comput. Imaging VII, 2009, vol.7246, no.1, 72460E.
35. D. Malioutov, S. Sanghavi, and A.Willsky, "Compressed sensing with sequential observations," in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process., Apr. 2008, pp. 3357-3360.
36. A. Edelman, "Eigenvalues and condition numbers of random matrices," SIAM J. Matrix Anal. Applicat., vol.9, p. 543, 1988.
37. M. Rudelson and R. Vershynin, "The Littlewood-Offord problem and invertibility of random matrices," Adv. Math., 2008.
38. Z. Wen and W. Yin, "FPC-AS: A MATLAB solver for -regularized least squares problems," [Online]. Available: http://www.caam. rice.edu/~optimization/L1/FPC-AS/
39. J. Buckheit, S. Chen, D. Donoho, and I. Johnstone, "Wavelab 850, Software Toolbox," [Online]. Available: http://www-stat.stanford.edu/ ~wavelab/