Proximal Newton-type methods for convex optimization

Advances in Neural Information Processing Systems

Volumn 2, Issue , 2012, Pages 827-835

  Lee, Jason D ^a   Sun, Yuekai ^a   Saunders, Michael A ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUSLY DIFFERENTIABLE; CONVEX OPTIMIZATION PROBLEMS; DIFFERENTIABLE FUNCTIONS; GLOBALLY CONVERGENT; NEWTON-TYPE METHODS; OBJECTIVE FUNCTIONS; OPTIMAL SOLUTIONS; RATES OF CONVERGENCE;

CONVEX OPTIMIZATION;

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

References (27)

1. A. Auslender and M. Teboulle, Interior gradient and proximal methods for convex and conic optimization, SIAM J. Optim., 16 (2006), pp. 697-725.
2. A. Beck and M. Teboulle, A fast iterative shrinkage-thresholding algorithm for linear inverse problems, SIAM J. Imaging Sci., 2 (2009), pp. 183-202.
3. S. R. Becker, M. J. Candés, and M. C. Grant, Templates for convex cone problems with applications to sparse signal recovery, Math. Program. Comput., 3 (2011), pp. 1-54.
4. S. Becker and J. Fadili, A quasi-Newton proximal splitting method, NIPS, Lake Tahoe, California, 2012.
5. S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge University Press, Cambridge, 2004.
6. E. J. Candés and B. Recht, Exact matrix completion via convex optimization, Found. Comput. Math, 9 (2009), pp. 717-772.
7. J. E. Dennis, Jr. and J. J. Moré, A characterization of superlinear convergence and its application to quasi-Newton methods, Math. Comp., 28, (1974), pp. 549-560.
8. S. C. Eisenstat and H. F. Walker, Choosing the forcing terms in an inexact Newton method, SIAM J. Sci. Comput., 17 (1996), pp. 16-32.
9. J. Friedman, T. Hastie, H. Holfing, and R. Tibshirani, Pathwise coordinate optimization, Ann. Appl. Stat. (2007), pp. 302-332
10. M. Fukushima and H. Mine, A generalized proximal point algorithm for certain non-convex minimization problems, Internat. J. Systems Sci., 12 (1981), pp. 989-1000.
11. C. J. Hsieh, M. A. Sustik, P. Ravikumar, and I. S. Dhillon, Sparse inverse covariance matrix estimation using quadratic approximation, NIPS, Granada, Spain, 2011.
12. D. Kim, S. Sra, and I. S. Dhillon, A scalable trust-region algorithm with applications to mixed-norm regression, ICML, Haifa, Israel, 2010.
13. Y. Nesterov, Gradient methods for minimizing composite objective function, CORE discussion paper, 2007.
14. G. Obozinski, B. Taskar, and M. I. Jordan, Joint covariate selection and joint subspace selection for multiple classification problems, Stat. Comput. (2010), pp. 231-252
15. P. Olsen, F. Oztoprak, J. Nocedal, S. Rennie, Newton-like methods for sparse inverse covariance estimation, NIPS, Lake Tahoe, California, 2012.
16. M. Patriksson, Nonlinear Programming and Variational Inequality Problems, Kluwer Academic Publishers, The Netherlands, 1999.
17. P. Ravikumar, M. J. Wainwright and J. D. Lafferty, High-dimensional Ising model selection using'1-regularized logistic regression, Ann. Statist. (2010), pp. 1287-1319.
18. M. Schmidt, Graphical Model Structure Learning with l1-Regularization, Ph.D. Thesis (2010), University of British Columbia
19. M. Schmidt, E. van den Berg, M. P. Friedlander, and K. Murphy, Optimizing costly functions with simple constraints: a limited-memory projected quasi-Newton algorithm, AISTATS, Clearwater Beach, Florida, 2009.
20. M. Schmidt, D. Kim, and S. Sra, Projected Newton-type methods in machine learning, in S. Sra, S. Nowozin, and S. Wright, editors, Optimization for Machine Learning, MIT Press (2011).
21. P. Tseng and S. Yun, A coordinate gradient descent method for nonsmooth separable minimization, Math. Prog. Ser. B, 117 (2009), pp. 387-423.
22. P. Tseng, On accelerated proximal gradient methods for convex-concave optimization, submitted to SIAM J. Optim. (2008).
23. R. Tibshirani, Regression shrinkage and selection via the lasso, J. R. Stat. Soc. Ser. B Stat. Methodol., 58 (1996), pp. 267-288.
24. S. J. Wright, R. D. Nowak, and M. A. T. Figueiredo, Sparse reconstruction by separable approximation, IEEE Trans. Signal Process., 57 (2009), pp. 2479-2493.
25. J. Yu, S. V. N. Vishwanathan, S. Günter, and N. N. Schraudolph, A Quasi-Newton Approach to Nonsmooth Convex Optimization, ICML, Helsinki, Finland, 2008.
26. G. X. Yuan, C. H. Ho and C. J. Lin, An improved GLMNET for'1-regularized logistic regression and support vector machines, National Taiwan University, Tech. Report 2011.
27. R. H. Zou and T. Hastie, Regularization and variable selection via the elastic net, J. R. Stat. Soc. Ser. B Stat. Methodol., 67 (2005), pp. 301-320.