On the convergence of an active-set method for ℓ 1 minimization

Optimization Methods and Software

Volumn 27, Issue 6, 2012, Pages 1127-1146

  Wen, Zaiwen ^a   Yin, Wotao ^b   Zhang, Hongchao ^c   Goldfarb, Donald ^d  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b Rice University   (United States)

^c LOUISIANA STATE UNIVERSITY   (United States)

^d Columbia University ^*  (United States)

Author keywords

active set; basis pursuit; compressed sensing; continuation; l 1 minimization; subspace optimization

Indexed keywords

ACTIVE SETS; BASIS PURSUITS; COMPRESSIVE SENSING; CONTINUATION; SUBSPACE OPTIMIZATION;

ALGORITHMS; SHRINKAGE;

OPTIMIZATION;

EID: 84864195124     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556788.2011.591398     Document Type: Article

References (22)

1. J. Barzilai and J.M. Borwein, Two-point step size gradient methods, IMA J. Numer. Anal. 8 (1988), pp. 141-148.
2. J.V. Burke and J.J. Moré, On the identification of active constraints, SIAM J. Numer. Anal. 25 (1988), pp. 1197-1211.
3. J.V. Burke and J.J. Moré, Exposing constraints, SIAM J. Optim. 4 (1994), pp. 573-595.
4. R.H. Byrd, N.I.M. Gould, J. Nocedal, and R.A. Waltz, An algorithm for nonlinear optimization using linear programming and equality constrained subproblems, Math. Program. 100 (2004), pp. 27-48.
5. R.H. Byrd, N.I.M. Gould, J. Nocedal, and R.A. Waltz, On the convergence of successive linear-quadratic programming algorithms, SIAM J. Optim. 16 (2005), pp. 471-489.
6. P.H. Calamai and J.J. Moré, Projected gradient methods for linearly constrained problems, Math. Program. 39 (1987), pp. 93-116.
7. P.L. Combettes and J.-C. Pesquet, Proximal thresholding algorithm for minimization over orthonormal bases, SIAM J. Optim. 18 (2007), pp. 1351-1376.
8. A.R. Conn, N.I.M. Gould, and P.L. Toint, Trust-region methods, MPS/SIAM Series on Optimization, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2000.
9. I. Daubechies, M. Defrise, and C. De Mol, An iterative thresholding algorithm for linear inverse problems with a sparsity constraint, Commun. Pure Appl. Math. 57 (2004), pp. 1413-1457.
10. F. Facchinei, A. Fischer, and C. Kanzow, On the accurate identification of active constraints, SIAM J. Optim. 9 (1999), pp. 14-32.
11. M. Figueiredo, R. Nowak, and S. 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.
12. W.W. Hager and H. Zhang, A new active set algorithm for box constrained optimization, SIAM J. Optim. 17 (2006), pp. 526-557.
13. E.T. Hale, W. Yin, and Y. Zhang, Fixed-point continuation for l1-minimization: Methodology and convergence, SIAM J. Optim. 19 (2008), pp. 1107-1130.
14. K. Koh, S.-J. Kim, and S. Boyd, An interior-point method for large-scale l1-regularized logistic regression, J.Mach. Learn. Res. 8 (2007), pp. 1519-1555.
15. H. Lee, A. Battle, R. Raina, and A. Ng, Efficient sparse coding algorithms, in Advances in Neural Information Processing Systems 19, B. Schölkopf, J. Platt, and T. Hoffman, eds., MIT Press, Cambridge, MA, 2007, pp. 801-808.
16. J.J. Moré and G. Toraldo, Algorithms for bound constrained quadratic programming problems, Numer. Math. 55 (1989), pp. 377-400.
17. J.J. Moré and G. Toraldo, On the solution of large quadratic programming problems with bound constraints, SIAM J. Optim. 1 (1991), pp. 93-113.
18. J. Shi, W. Yin, S. Osher, and P. Sajda, A fast hybrid algorithm for large-scale l1-regularized logistic regression, J. Mach. Learn. Res. 11 (2010), pp. 713-741.
19. P. Tseng and S.Yun, A coordinate gradient descent method for nonsmooth separable minimization, Math. Program. 117 (2009), pp. 387-423.
20. Z.Wen,W.Yin, D. Goldfarb, andY. Zhang, A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization and continuation, SIAM J. Sci. Comput. 32 (2010), pp. 1832-1857.
21. G.-X. Yuan, K.-W. Chang, C.-J. Hsieh, and C.-J. Lin, A comparison of optimization methods and software for large-scale l1-regularized linear classification, J. Mach. Learn. Res. 11 (2010), pp. 3183-3234.
22. H. Zhang andW.W. Hager, A nonmonotone line search technique and its application to unconstrained optimization, SIAM J. Optim. 14 (2004), pp. 1043-1056.