Fetching the paper…
Reading the bibliography…
We generalize Newton-type methods for minimizing smooth functions to handle a sum of two convex functions: a smooth function and a nonsmooth function with a simple proximal mapping.
A characterization of superlinear convergence and its application to quasi-Newton methods
J.E. Dennis and J.J. Moré · 1974
Earlier work this paper cites.
A generalized proximal point algorithm for certain non-convex minimization problems
M. Fukushima and H. Mine · 1981
Earlier work this paper cites.
Inexact Newton methods
R.S. Dembo, S.C. Eisenstat, and T. Steihaug · 1982
Earlier work this paper cites.
Choosing the forcing terms in an inexact Newton method
S.C. Eisenstat and H.F. Walker · 1996
Earlier work this paper cites.
Regression shrinkage and selection via the lasso
R. Tibshirani · 1996
Earlier work this paper cites.
Cost approximation: a unified framework of descent algorithms for nonlinear programs
M. Patriksson · 1998
Earlier work this paper cites.
Nonlinear Programming and Variational Inequality Problems: A Unified Approach
M. Patriksson · 1999
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course
Y. Nesterov · 2003
Earlier work this paper cites.
Convex optimization
S. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
Pathwise coordinate optimization
J. Friedman, T. Hastie, H. Höfling, and R. Tibshirani · 2007
Earlier work this paper cites.
Sparse inverse covariance estimation with the graphical lasso
J. Friedman, T. Hastie, and R. Tibshirani · 2008
Cited alongside, same era.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
A. Beck and M. Teboulle · 2009
Cited alongside, same era.
Exact matrix completion via convex optimization
E.J. Candès and B. Recht · 2009
Cited alongside, same era.
Optimizing costly functions with simple constraints: A limited-memory projected quasi-Newton algorithm
M. Schmidt, E. Van Den Berg, M.P. Friedlander, and K. Murphy · 2009
Cited alongside, same era.
On accelerated proximal gradient methods for convex-concave optimization
P. Tseng · 2009
Cited alongside, same era.
A coordinate gradient descent method for nonsmooth separable minimization
P. Tseng and S. Yun · 2009
A quasi-Newton approach to nonsmooth convex optimization problems in machine learning
J. Yu, S.V.N. Vishwanathan, S. Günter, and N.N. Schraudolph · 2010
Later among the works it cites.
Templates for convex cone problems with applications to sparse signal recovery
S.R. Becker, E.J. Candès, and M.C. Grant · 2011
Later among the works it cites.
Sparse inverse covariance matrix estimation using quadratic approximation
C.J. Hsieh, M.A. Sustik, I.S. Dhillon, and P. Ravikumar · 2011
Later among the works it cites.
An augmented Lagrangian approach for sparse principal component analysis
Z. Lu and Y. Zhang · 2011
Later among the works it cites.
Projected Newton-type methods in machine learning
M. Schmidt, D. Kim, and S. Sra · 2011
Later among the works it cites.
A quasi-Newton proximal splitting method
S. Becker and M.J. Fadili · 2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Sparse reconstruction by separable approximation
S.J. Wright, R.D. Nowak, and M.A.T. Figueiredo · 2009
Cited alongside, same era.
A scalable trust-region algorithm with application to mixed-norm regression
D. Kim, S. Sra, and I.S. Dhillon · 2010
Cited alongside, same era.
Graphical model structure learning with ℓ 1 \ell_{1} -regularization
M. Schmidt · 2010
Cited alongside, same era.
Closest in time.
Newton-like methods for sparse inverse covariance estimation
P.A. Olsen, F. Oztoprak, J. Nocedal, and S.J. Rennie · 2012
Closest in time.
Iterative thresholding algorithm for sparse inverse covariance estimation
B. Rolfs, B. Rajaratnam, D. Guillot, I. Wong, and A. Maleki · 2012
Closest in time.
An improved glmnet for ℓ 1 \ell_{1} -regularized logistic regression
G.X. Yuan, C.H. Ho, and C.J. Lin · 2012
Closest in time.