Fetching the paper…
Reading the bibliography…
We introduce a generic scheme for accelerating gradient-based optimization methods in the sense of Nesterov.
Fonctions convexes duales et points proximaux dans un espace hilbertien
J.-J. Moreau · 1962
Earlier work this paper cites.
Brève communication. Régularisation d’inéquations variationnelles par approximations successives
B. Martinet · 1970
Earlier work this paper cites.
Monotone operators and the proximal point algorithm
R. T. Rockafellar · 1976
Earlier work this paper cites.
Functional analysis
K. Yosida · 1980
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
A. Nemirovskii and D. B. Yudin · 1983
Earlier work this paper cites.
A method of solving a convex programming problem with convergence rate O O (1/ k 2 k^{2} )
Y. Nesterov · 1983
Earlier work this paper cites.
Numerical methods for nondifferentiable convex optimization
A. Auslender · 1987
Earlier work this paper cites.
On the convergence of the proximal point algorithm for convex minimization
O. Güler · 1991
Earlier work this paper cites.
New proximal point algorithms for convex minimization
O. Güler · 1992
Earlier work this paper cites.
Convergence of some algorithms for convex minimization
R. Correa and C. Lemaréchal · 1993
Earlier work this paper cites.
Practical aspects of the Moreau–Yosida regularization: Theoretical preliminaries
C. Lemaréchal and C. Sagastizábal · 1997
Earlier work this paper cites.
A unified framework for some inexact proximal point algorithms
M. V. Solodov and B. F. Svaiter · 2001
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course
Y. Nesterov · 2004
Earlier work this paper cites.
Regularization and variable selection via the elastic net
H. Zou and T. Hastie · 2005
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.
Convergence rates of inexact proximal-gradient methods for convex optimization
M. Schmidt, N. Le Roux, and F. Bach · 2011
Earlier work this paper cites.
Optimization with sparsity-inducing penalties
F. Bach, R. Jenatton, J. Mairal, and G. Obozinski · 2012
Cited alongside, same era.
Descentwise inexact proximal algorithms for smooth optimization
M. Fuentes, J. Malick, and C. Lemaréchal · 2012
Cited alongside, same era.
An accelerated inexact proximal point algorithm for convex minimization
B. He and X. Yuan · 2012
Cited alongside, same era.
Efficiency of coordinate descent methods on huge-scale optimization problems
Y. Nesterov · 2012
Cited alongside, same era.
Inexact and accelerated proximal point algorithms
S. Salzo and S. Villa · 2012
Cited alongside, same era.
Proximal stochastic dual coordinate ascent
S. Shalev-Shwartz and T. Zhang · 2012
Incremental majorization-minimization optimization with application to large-scale machine learning
J. Mairal · 2015
Later among the works it cites.
Stochastic primal-dual coordinate method for regularized empirical risk minimization
Y. Zhang and L. Xiao · 2015
Later among the works it cites.
Dimension-free iteration complexity of finite sum optimization problems
Y. Arjevani and O. Shamir · 2016
Later among the works it cites.
A simple practical accelerated method for finite sums
A. Defazio · 2016
Later among the works it cites.
Nonsmooth minimization using smooth envelope functions
P. Giselsson and M. Fält · 2016
Later among the works it cites.
End-to-end kernel learning with supervised convolutional kernel networks
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Accelerating stochastic gradient descent using predictive variance reduction
R. Johnson and T. Zhang · 2013
Cited alongside, same era.
Gradient methods for minimizing composite functions
Y. Nesterov · 2013
Cited alongside, same era.
First-order methods of smooth convex optimization with inexact oracle
O. Devolder, F. Glineur, and Y. Nesterov · 2014
Cited alongside, same era.
Proximal algorithms
N. Parikh and S. P. Boyd · 2014
Cited alongside, same era.
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
P. Richtárik and M. Takáč · 2014
Cited alongside, same era.
A proximal stochastic gradient method with progressive variance reduction
L. Xiao and T. Zhang · 2014
Cited alongside, same era.
J. Mairal · 2016
Later among the works it cites.
Regularized nonlinear acceleration
D. Scieur, A. d’ Aspremont, and F. Bach · 2016
Later among the works it cites.
Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
S. Shalev-Shwartz and T. Zhang · 2016
Later among the works it cites.
A. Themelis, L. Stella, and P. Patrinos · 2016
Later among the works it cites.
Tight complexity bounds for optimizing composite objectives
B. E. Woodworth and N. Srebro · 2016
Later among the works it cites.
Katyusha: The first direct acceleration of stochastic gradient methods
Z. Allen-Zhu · 2017
Closest in time.
An optimal randomized incremental gradient method
G. Lan and Y. Zhou · 2017
Closest in time.
Minimizing finite sums with the stochastic average gradient
M. Schmidt, N. Le Roux, and F. Bach · 2017
Closest in time.
Vector Extrapolation Methods with Applications
A. Sidi · 2017
Closest in time.
Catalyst acceleration for gradient-based non-convex optimization
C. Paquette, H. Lin, D. Drusvyatskiy, J. Mairal, and Z. Harchaoui · 2018
Closest in time.