A proximal-gradient homotopy method for the ℓ 1-regularized least-squares problem

Proceedings of the 29th International Conference on Machine Learning, ICML 2012

Volumn 1, Issue , 2012, Pages 839-846

  Xiao, Lin ^a   Zhang, Tong ^b  

^a MICROSOFT RESEARCH   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSIVE SENSING; CONVERGENCE RATES; HOMOTOPY CONTINUATION; HOMOTOPY METHOD; HOMOTOPY SOLUTION PATHS; LEAST SQUARE; OBJECTIVE FUNCTIONS; REGULARIZATION PARAMETERS; SOLUTION PATH; SPARSE RECOVERY; SUBLINEAR;

GRADIENT METHODS; LEARNING SYSTEMS; SIGNAL RECONSTRUCTION;

PROBLEM SOLVING;

EID: 84867128532     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Becker, S. R., Bobin, J., and Candès, E. J. NESTA: A fast and accurate first-order method for sparse recovery. SIAM Journal on Imaging Sciences, 4(1):1-39, 2011.
2. Bickel, P., Ritov, Y., and Tsybakov, A. Simultaneous analysis of Lasso and Dantzig selector. Annals of Statistics, 37:1705-1732, 2009.
3. Bioucas-Dias, J. M. and Figueiredo, M. A. T. A new TwIST: Two-step iterative shrinking/thresholding algorithms for image restoration. IEEE Transactions on Image Processing, 16(12):2992-3004, 2007.
4. Candès, E. J. and Tao, T. Decoding by linear programming. IEEE Transactions on Information Theory, 51(12):4203-4215, December 2005.
5. Daubechies, I., Defriese, M., and Mol, C. De. An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Comm. Pure Appl. Math., 57(11):1413-1457, 2004.
6. Efron, B., Hastie, T., Johnstone, I., and Tibshirani, R. Least angle regression (with discussion). Annals of Statistics, 32:407-499, 2004.
7. 1-minimization: Methodology and convergence. SIAM Journal on Optimization, 19(3):1107-1130, 2008.
8. Koltchinskii, V. The dantzig selector and sparsity oracle inequalities. Bernoulli, 15:799-828, 2009.
9. Meinshausen, N. and Bühlmann, P. High dimensional graphs and variable selection with the lasso. Annals of Statistics, 34:1436-1462, 2006.
10. Nesterov, Yu. Introductory Lectures on Convex Optimization: A Basic Course. Kluwer, Boston, 2004.
11. Nesterov, Yu. Smooth minimization of nonsmooth functions. Mathematical Programming, 103(1):127-152, 2005.
12. Nesterov, Yu. Gradient methods for minimizing composite objective function. CORE discussion paper 2007/76, Center for Operations Research and Econometrics, Catholic University of Louvain, Belgium, September 2007.
13. Osborne, M., Presnell, B., and Turlach, B. A new approach to variable selection in least squares problems. IMA Journal of Numerical Analysis, 20:389-404, 2000.
14. Rockafellar, R. T. Convex Analysis. Princeton University Press, 1970.
15. Tseng, P. On accelerated proximal gradient methods for convex-concave optimization. Manuscript submitted to SIAM Journal on Optimization, 2008.
16. van de Geer, S. and Bühlmann, P. On the conditions used to prove oracle results for the lasso. Electronic Journal of Statistics, 3:1360-1392, 2009.
17. Wen, Z., Yin, W., Goldfarb, D., and Zhang, Y. A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization and continuation. SIAM Journal on Scientific Computing, 32(4):1832-1857, 2010.
18. Wright, S. J., Nowad, R. D., and Figueiredo, M. A. T. Sparse reconstruction by separable approximation. IEEE Transactions on Signal Processing, 57(7):2479-2493, July 2009.
19. Zhang, C.-H. and Huang, J. The sparsity and bias of the lasso selection in high-dimensional linear regression. Annals of Statistics, 36:1567-1594, 2008.
20. 1 regularization. Annals of Statistics, 37:2109-2144, 2009.