Fast First-Order Methods for Composite Convex Optimization with Backtracking
- 26 March 2014
- journal article
- research article
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 14 (3) , 389-417
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Fast alternating linearization methods for minimizing the sum of two convex functionsMathematical Programming, 2012
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of MultipliersFoundations and Trends in Machine Learning, 2011
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse ProblemsSIAM Journal on Imaging Sciences, 2009
- Model Selection and Estimation in Regression with Grouped VariablesJournal of the Royal Statistical Society Series B: Statistical Methodology, 2005
- Smooth minimization of non-smooth functionsMathematical Programming, 2004
- Introductory Lectures on Convex Optimization2004
- Regression Shrinkage and Selection Via the LassoJournal of the Royal Statistical Society Series B: Statistical Methodology, 1996