Fetching the paper…
Reading the bibliography…
Accelerated gradient methods play a central role in optimization, achieving optimal rates in many settings.
Problem Complexity and Method Efficiency in Optimization
Arkadi Nemirovskii and David Yudin · 1983
Earlier work this paper cites.
A method of solving a convex programming problem with convergence rate O ( 1 / k 2 ) {O}(1/k^{2})
Yurii Nesterov · 1983
Earlier work this paper cites.
Hessian Riemannian gradient flows in convex programming
Felipe Alvarez, Jérôme Bolte, and Olivier Brahic · 2004
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course
Yurii Nesterov · 2004
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Yurii Nesterov · 2005
Earlier work this paper cites.
Finite-time convergent gradient flows with applications to network consensus
Jorge Cortés · 2006
Earlier work this paper cites.
Cubic regularization of Newton’s method and its global performance
Yurii Nesterov and Boris T. Polyak · 2006
Earlier work this paper cites.
Gradient methods for minimizing composite objective function
Yurii Nesterov · 2007
Earlier work this paper cites.
Accelerating the cubic regularization of Newton’s method on convex problems
Yurii Nesterov · 2008
Earlier work this paper cites.
On accelerated proximal gradient methods for convex-concave optimization
Paul Tseng · 2008
Earlier work this paper cites.
Optimal Transport, Old and New
Cedric Villani · 2008
Earlier work this paper cites.
Estimate sequence methods: Extensions and approximations
Michel Baes · 2009
Earlier work this paper cites.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
Amir Beck and Marc Teboulle · 2009
Cited alongside, same era.
Accelerated gradient methods for stochastic optimization and online learning
Chonghai Hu, James T. Kwok, and Weike Pan · 2009
Cited alongside, same era.
Multi-label multiple kernel learning
Shuiwang Ji, Liang Sun, Rong Jin, and Jieping Ye · 2009
Cited alongside, same era.
An accelerated gradient method for trace norm minimization
Shuiwang Ji and Jieping Ye · 2009
Cited alongside, same era.
Accelerated dual decomposition for MAP inference
Vladimir Jojic, Stephen Gould, and Daphne Koller · 2010
Cited alongside, same era.
Primal-dual first-order methods with O ( 1 / ϵ ) {O(1/\epsilon)} iteration-complexity for cone programming
Guanghui Lan, Zhaosong Lu, and Renato Monteiro · 2011
On lower and upper bounds for smooth and strongly convex optimization problems
Yossi Arjevani, Shai Shalev-Shwartz, and Ohad Shamir · 2015
Later among the works it cites.
Fast inertial dynamics and FISTA algorithms in convex optimization: Perturbation aspects
Hedy Attouch and Zaki Chbani · 2015
Later among the works it cites.
On the fast convergence of an inertial gradient-like system with vanishing viscosity
Hedy Attouch, Juan Peypouquet, and Patrick Redont · 2015
Later among the works it cites.
A geometric alternative to Nesterov’s accelerated gradient descent
Sébastien Bubeck, Yin Tat Lee, and Mohit Singh · 2015
Later among the works it cites.
From averaging to acceleration, there is only a step-size
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
An optimal method for stochastic composite optimization
Guanghui Lan · 2012
Cited alongside, same era.
Convex Optimization II: Algorithms
Anatoli Juditsky · 2013
Cited alongside, same era.
Parallel boosting with momentum
Indraneel Mukherjee, Kevin Canini, Rafael Frongillo, and Yoram Singer · 2013
Cited alongside, same era.
Linear coupling: An ultimate unification of gradient and mirror descent
Zeyuan Allen-Zhu and Lorenzo Orecchia · 2014
Cited alongside, same era.
A differential equation for modeling Nesterov’s accelerated gradient method: Theory and insights
Weijie Su, Stephen Boyd, and Emmanuel J. Candès · 2014
Cited alongside, same era.
Nicolas Flammarion and Francis R. Bach · 2015
Later among the works it cites.
Accelerated gradient methods for nonconvex nonlinear and stochastic programming
Saeed Ghadimi and Guanghui Lan · 2015
Later among the works it cites.
Accelerated mirror descent in continuous and discrete time
Walid Krichene, Alexandre Bayen, and Peter Bartlett · 2015
Later among the works it cites.
Accelerated proximal gradient methods for nonconvex programming
Huan Li and Zhouchen Lin · 2015
Later among the works it cites.
Adaptive restart for accelerated gradient schemes
Brendan O’Donoghue and Emmanuel Candès · 2015
Later among the works it cites.
The information geometry of mirror descent
Garvesh Raskutti and Sayan Mukherjee · 2015
Later among the works it cites.
Analysis and design of optimization algorithms via integral quadratic constraints
Laurent Lessard, Benjamin Recht, and Andrew Packard · 2016
Closest in time.