Minimizing nonconvex functions for sparse vector reconstruction

IEEE Transactions on Signal Processing

Volumn 58, Issue 7, 2010, Pages 3485-3496

  Mourad, Nasser ^a   Reilly, James P ^a  

^a MCMASTER UNIVERSITY   (Canada)

Author keywords

Compressed sensing; Nonconvex optimization; Optimization; Sparse systems; Sparsity

Indexed keywords

APRIORI; COMPRESSED SENSING; CONVERGENCE PROPERTIES; CONVEX FUNCTIONS; CONVEX OBJECTIVES; FIXED POINTS; ITERATIVE REWEIGHTED LEAST SQUARE; LINEAR SYSTEM OF EQUATIONS; LOCAL MINIMUMS; NONCONVEX; NONCONVEX FUNCTIONS; NONCONVEX OPTIMIZATION; NONNEGATIVE ORTHANT; NOVEL METHODOLOGY; NUMERICAL RESULTS; OBJECTIVE FUNCTIONS; RANDOM PERTURBATIONS; SOLUTION VECTORS; SPARSE SYSTEMS; SPARSE VECTORS;

ALGORITHMS; ITERATIVE METHODS; LINEAR SYSTEMS; OPTIMIZATION; PERTURBATION TECHNIQUES; SIGNAL RECONSTRUCTION;

CONVERGENCE OF NUMERICAL METHODS;

EID: 77953806010     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2010.2046900     Document Type: Article

References (37)

1. P. Rodríguez and B. Wohlberg, "An iterative reweighted norm algorithm for total variation regularization," IEEE Signal Process. Lett., vol.14, no.12, pp. 948-951, Dec. 2007.
2. S. G. Mallat and Z. Zhang, "Matching pursuits with time-frequency dictionaries," IEEE Trans. Signal Process., vol.41, no.12, pp. 3397-3415, Dec. 1993.
3. G. H. Golub and C. F. Van Loan, Matrix Computations. Baltimore, MD: Johns Hopkins Univ. Press, 1989.
4. S. Lesage, R. Gribonval, F. Bimbot, and L. Benaroya, "Learning unions of orthonormal bases with thresholded singular value decomposition," in Proc. IEEE Int. Conf. Acoust. Speech Signal Process., Philadelphia, PA, 2005, vol.5, pp. v/293-v/296, Mar. 2005.
5. Y. Li, A. Cichocki, and S. Amari, "Sparse component analysis for blind source separation with less sensors than sources," in Proc. 4th Int. Symp. Independent Component Analysis Blind Source Separation, 2003, pp. 89-94.
6. Y. Li, A. Cichocki, S. Amari, S. Shishkin, J. Cao, and F. Gu, "Sparse representation and its applications in blind source separation," presented at the 7th Annu. Conf. Neural Information Processing Systems, Vancouver, BC, Canada, Dec. 2003.
7. I. F. Gorodnitsky and B. D. Rao, "Sparse signal reconstructions from limited data using FOCUSS: A re-weighted minimum norm algorithm," IEEE Trans. Signal Process., vol.45, no.3, pp. 600-616, Mar. 1997.
8. P. Xu, Y. Tian, H. Chen, and D. Yao, "LP norm iterative sparse solution for EEG source localization," IEEE Trans. Biomed. Eng., vol.54, no.3, pp. 400-409, Mar. 2007.
9. K. Kreutz-Delgado and B. D. Rao, "FOCUSS-based dictionary learning algorithms," in Proc. Wavelet Appl. Signal Image Process., Bellingham, WA, Jul./Aug. 2000, vol.4119, pp. 459-473.
10. M. Aharon, M. Elad, and A. Bruckstein, "The K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation," IEEE Trans. Signal Process., vol.54, no.11, pp. 4311-4322, Nov. 2006.
11. B. Jeffs and M. Gunsay, "Restoration of blurred star field images by maximally sparse optimization," IEEE Trans. Image Process., vol.2, no.2, pp. 202-211, Mar. 1993.
12. E. J. Candès, M. B. Wakin, and S. P. Boyd, "Enhancing sparsity by reweighted l1 minimization," J. Fourier Anal. Appl., vol.14, no.5, pp. 877-905, Dec. 2008, special issue on sparsity.
13. S. Mallat and Z. Zhang, "Matching pursuits with time-frequency dictionaries," IEEE Trans. Signal Process., vol.41, no.12, pp. 3397-3415, Dec. 1993.
14. J. A. Tropp, A. C. Gilbert, and M. J. Strauss, "Algorithms for simultaneous sparse approximation, Part I: Greedy pursuit," Signal Process., vol.86, no.3, pp. 572-588, 2006.
15. S. Chen and D. Donoho, "Basis pursuit," in Proc. 28th Asilomar Conf. Signals, Syst. Comput., Monterey, CA, Nov. 1994, vol.I, pp. 41-44.
16. S. S. Chen, D. L. Donoho, and M. A. Saunder, "Atomic decomposition by basis pursuit," SIAM J. Sci. Comput., vol.20, no.1, pp. 33-61, 1998.
17. T. Blumensath and M. E. Davies, "Iterative thresholding for sparse approximations," J. Fourier Anal. Appl., vol.14, no.5, pp. 629-654, Dec. 2008.
18. B. D. Rao and K. Kreutz-Delgado, "An affine scaling methodology for best basis selection," IEEE Trans. Signal Process., vol.47, no.1, pp. 187-202, Jan. 1999.
19. R. Chartrand and W. Yin, "Iteratively reweighted algorithms for compressive sensing," in Proc. Acoustics, Speech and Signal Processing, 2008, pp. 3869-3872.
20. I. Daubechies, R. DeVore, M. Fornasier, and S. Gunturk, "Iteratively re-weighted least squares minimization for sparse recovery," Commun. Pure Appl. Math., 2009, to be published.
21. D. Baron, M. F. Duarte, M. B. Wakin, S. Sarvotham, and R. G. Baraniuk, Distrib. Compress. Sens., Jan. 2009, arXiv:0901.3403v1.
22. E. Candes 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.
23. D. L. Donoho and J. Tanner, "Thresholds for the recovery of sparse solutions via L1 minimization," in Proc. 40th Annu. Conf. Information Sciences and Systems, 2006, pp. 202-206.
24. R. Chartrand, "Exact reconstruction of sparse signals via nonconvex minimization," IEEE Signal Process. Lett., vol.14, no.10, pp. 707-710, Oct. 2007.
25. N. Mourad and J. Reilly, "l1 minimization for Sparse Vector Reconstruction," presented at the ICASSP, Taipei, Taiwan, Apr. 19-24, 2009.
26. R. Chartrand and V. Staneva, "Restricted isometry properties and nonconvex compressive sensing," Inverse Problems, vol.24, no.035020, pp. 1-14, 2008.
27. Y. Li, "A globally convergent method for lp problems," SIAM J. Optim., vol.3, no.3, pp. 609-629, 1993.
28. D. L. Donoho and Y. Tsaig, "Fast solution of lp -norm minimization problems when the solution may be sparse," IEEE Trans. Inf. Theory, vol.54, no.11, pp. 4789-4812, Nov. 2008.
29. R.Wolke and H. Schwetlick, "Iteritevely reweighted least squares: Algorithms, convergence analysis, and numerical comparisons," SIAM J. Sci. Stat. Comput., vol.9, no.5, pp. 907-921, 1988.
30. R. Wolke, "Iteratively reweighted least squares: A comparison of several single step algorithms for linear models," BIT Numer. Math., vol.32, no.3, pp. 506-524, 1992.
31. S. L. Campbell and C. D. Meyer, Generalized Inverse of Linear Transformations. London, U.K.: Pitman, 1979.
32. N. Mourad, "Advances in sparse signal analysis with applications to blind source separation and EEG/MEG signal processing," Ph.D. dissertation, McMaster Univ., Hamilton, ON, Canada, 2009.
33. D. R. Hunter and K. Lange, "A tutorial on MM algorithms," Amer. Statist., vol.58, no.1, pp. 30-37, 2004.
34. R. G. Baraniuk, "Compressive sensing," IEEE Signal Process. Mag., vol.24, no.4, pp. 118-121, Jul. 2007.
35. S. Osher, Y. Mao, B. Dong, and A. W. Yin, Fast Linearized Bregman Iteration for Compressive Sensing and Sparse Denoising. [Online]. Available: ftp://ftp.math.ucla.edu/pub/camreport/cam08-37.pdf
36. W. Yin, S. Osher, D. Goldfarb, and J. Darbon, "Bregman iterative algorithms gor lp -minimization with applications to compresed sensing," SIAM. J. Imag. Sci., vol.1, no.1, pp. 143-168, 2008.
37. G. H. Mohimani, M. Babaie-Zadah, and C. Jutten, "A fast approach for overcomplete sparse decomposition based on smoothed lp norm," IEEE Trans. Signal Process., vol.57, no.1, pp. 289-301, Jan. 2009.