Fetching the paper…
Reading the bibliography…
In [19], a general, inexact, efficient proximal quasi-Newton algorithm for composite optimization problems has been proposed and a sublinear global convergence rate has been established.
Informational complexity and efficient methods for solution of convex extremal problems
A. Nemirovski and D. Yudin · 1983
Earlier work this paper cites.
A method for solving the convex programming problem with convergence rate 𝒪 ( 1 / k 2 ) \mathcal{O}(1/k^{2})
Y. E. Nesterov · 1983
Earlier work this paper cites.
Representations of quasi N
R. H Byrd, J. Nocedal, and R. B Schnabel · 1994
Earlier work this paper cites.
Regression shrinkage and selection via the lasso
R. Tibshirani · 1996
Earlier work this paper cites.
Introductory Lectures on Convex Programming: A Basic Course
Y. E. Nesterov · 2004
Earlier work this paper cites.
Smooth minimization for non-smooth functions
Y. E. Nesterov · 2005
Earlier work this paper cites.
Numerical Optimization
J. Nocedal and S.J. Wright · 2006
Earlier work this paper cites.
On accelerated proximal gradient methods for convex-concave optimization
P. Tseng · 2008
Earlier work this paper cites.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
A. Beck and M. Teboulle · 2009
Earlier work this paper cites.
A greedy coordinate ascent method for sparse inverse covariance selection problem
K. Scheinberg and I. Rish · 2009
Cited alongside, same era.
Stochastic methods for ℓ 1 − \ell_{1}- regularized loss minimization
S. Shalev-Shwartz and A. Tewari · 2009
Cited alongside, same era.
A comparison of optimization methods and software for large-scale ℓ 1 \ell_{1} -regularized linear classification
G. X. Yuan, K. W. Chang, C. J. Hsieh, and C. J. Lin · 2010
Cited alongside, same era.
Error bounds, quadratic growth, and linear convergence of proximal methods
D. Drusvyatskiy and A. S. Lewis · 2011
Cited alongside, same era.
Sparse inverse covariance matrix estimation using quadratic approximation
C. J. Hsieh, M. Sustik, I. Dhilon, and P. Ravikumar · 2011
Cited alongside, same era.
Convergence rate of inexact proximal-gradient method for convex optimization
An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP
K. Jiang, D. Sun, and K. Toh · 2012
Later among the works it cites.
Proximal N
J. D. Lee, Y. Sun, and M. A. Saunders · 2012
Later among the works it cites.
Newton-like methods for sparse inverse covariance estimation
P. A. Olsen, F. Oztoprak, J. Nocedal, and S. J. Rennie · 2012
Later among the works it cites.
An inexact successive quadratic approximation method for convex ℓ 1 \ell_{1} -regularized optimization
R. Byrd, J. Nocedal, and F. Oztoprak · 2013
Later among the works it cites.
Gradient methods for minimizing composite objective function
Y. E. Nesterov · 2013
Later among the works it cites.
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
P. Richtarik and M. Takac · 2014
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Schmidt, N. L. Roux, and F. Bach · 2011
Cited alongside, same era.
Supplementary material for the paper convergence rates of inexact proximal-gradient methods for convex optimization
M. Schmidt, N. L. Roux, and F. Bach · 2011
Cited alongside, same era.
Optimization for Machine Learning
S. Sra, S. Nowozin, and S.J. Wright · 2011
Cited alongside, same era.
Accelerated and inexact forward-backward algorithms
S. Villa, S. Salzo, L. Baldassarre, and A. Verri · 2011
Cited alongside, same era.
Later among the works it cites.
Fast first-order methods for composite convex optimization with backtracking
K. Scheinberg, D. Goldfarb, and X. Bai · 2014
Later among the works it cites.
Optimization algorithms in machine learning
H. Ghanbari and K. Scheinberg · 2016
Closest in time.
Practical inexact proximal quasi- N
K. Scheinberg and X. Tang · 2016
Closest in time.