A first-order smoothed penalty method for compressed sensing

SIAM Journal on Optimization

Volumn 21, Issue 1, 2011, Pages 287-313

  Aybat, N S ^a   Iyengar, G ^a  

^a Department of Earth and Environmental Sciences   (United States)

Author keywords

Basis pursuit; Compressed sensing; l1 minimization; Nesterov's method; Smooth approximation of nonsmooth functions; Sparse optimization

Indexed keywords

BASIS PURSUITS; COMPRESSED SENSING; L1-MINIMIZATION; NESTEROV'S METHOD; SMOOTH APPROXIMATION OF NONSMOOTH FUNCTIONS; SPARSE OPTIMIZATION;

ALGORITHMS; CONVEX OPTIMIZATION; FUNCTIONS; SIGNAL RECONSTRUCTION;

OPTIMIZATION;

EID: 79957449870     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/090762294     Document Type: Article

References (20)

1. N. S. AYBAT AND A. CHAKRABORTY, Fast reconstruction of CT images from parsimonious angular measurements via compressed sensing, SIAM J. Imaging Sci., 2009, submitted.
2. N. S. AYBAT AND G. IYENGAR, A first-order augmented Lagrangian method for compressed sensing, SIAM J. Optim., 2009, submitted.
3. S. BECKER, J. BOBIN, AND E. CANDÈS, Nesta: A fast and accurate first-order method for sparse recovery, SIAM J. Imaging Sci., 4 (2011), pp. 1-39.
4. E. CANDÈS AND J. ROMBERG, Quantitative robust uncertainty principles and optimally sparse decompositions, Found. Comput. Math., 6 (2006), pp. 227-254. (Pubitemid 43824483)
5. E. CANDÈS, J. ROMBERG, AND T. TAO, Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information, IEEE Trans. Inform. Theory, 52 (2006), pp. 489-509. (Pubitemid 43174093)
6. E. CANDÈS AND T. TAO, Near optimal signal recovery from random projections: Universal encoding strategies?, IEEE Trans. Inform. Theory, 52 (2006), pp. 5406-5425. (Pubitemid 46445381)
7. I. DAUBECHIES, M. DEFRISE, AND C. DE MOL, An iterative thresholding algorithm for linear inverse problems with a sparsity constraint, Comm. Pure Appl. Math., 57 (2004), pp. 1413-1457. (Pubitemid 39427442)
8. I. DAUBECHIES, M. FORNASIER, AND I. LORIS, Accelerated projected gradient method for linear inverse problems with sparsity constraints, J. Fourier Anal. Appl., 14 (2008), pp. 764-792.
9. D. DONOHO, Compressed sensing, IEEE Trans. Inform. Theory, 52 (2006), pp. 1289-1306.
10. M. A. FIGUEIREDO, R. NOWAK, AND S. J. WRIGHT, Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems, IEEE J. Sel. Top. Signal Process., 1 (2007), pp. 586-597. (Pubitemid 351276802)
11. 1-regularized minimization with applications to compressed sensing, Technical report, Rice University, Houston, TX, 2007.
12. 1-minimization: Methodology and convergence, SIAM J. Optim., 19 (2008), pp. 1107-1130.
13. S. HODA, A. GILPIN, AND J. PENA, Smoothing techniques for computing nash equilibria of sequential games, Math. Oper. Res., 35 (2010), pp. 494-512.
14. P. J. HÜBER, Robust Statistics, Wiley, New York, 1981.
15. K. KOH, S. J. KIM, AND S. BOYD, Solver for l1-regularized least squares problems, Technical report, Stanford University, Stanford, CA, 2007.
16. YU. NESTEROV, Introductory Lectures on Convex Optimization: A Basic Course, Kluwer Academic Publishers, Norwell, MA, 2004.
17. YU. NESTEROV, Smooth minimization of nonsmooth functions, Math. Program., 103 (2005), pp. 127-152.
18. E. VAN DEN BERG AND M. P. FRIEDLANDER, Probing the pareto frontier for basis pursuit solutions, SIAM J. Sci. Comput., 31 (2008), pp. 890-912.
19. Z. WEN, W. YIN, D. GOLDFARB, AND Y. ZHANG, A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation, SIAM J. Sci. Comput., 32 (2010), pp. 1832-1857.
20. 1minimization with applications to compressed sensing, SIAM J. Imaging Sci., 1 (2008), pp. 143-168.