Fetching the paper…
Reading the bibliography…
While many approaches were developed for obtaining worst-case complexity bounds for first-order optimization methods in the last years, there remain theoretical gaps in cases where no such bound can be found.
Numerical determination of fundamental modes
Donald A. Flanders and George Shortley · 1950
Earlier work this paper cites.
Solution of systems of linear equations by
Cornelius Lanczos · 1952
Earlier work this paper cites.
On Richardson’s method for solving linear systems with positive definite matrices
David Young · 1953
Earlier work this paper cites.
Control System Analysis and Design Via the “Second Method” of Lyapunov: II—Discrete-time systems
R. E. Kalman and J. E. Bertram · 1960
Earlier work this paper cites.
Control System Analysis and Design Via the “Second Method” of Lyapunov: I—Continuous-Time Systems
R. E. Kalman and J. E. Bertram · 1960
Earlier work this paper cites.
Gradient methods for the minimisation of functionals
Boris T. Polyak · 1963
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.
The general problem of the stability of motion
Aleksandr Mikhailovich Lyapunov and A.T. Fuller · 1992
Earlier work this paper cites.
Introductory Lectures on Convex Optimization
Yurii Nesterov · 2003
Earlier work this paper cites.
The tradeoffs of large scale learning
Léon Bottou and Olivier Bousquet · 2007
Earlier work this paper cites.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
Amir Beck and Marc Teboulle · 2009
Earlier work this paper cites.
Performance of first-order methods for smooth convex minimization: a novel approach
Yoel Drori and Marc Teboulle · 2014
Cited alongside, same era.
Convex optimization: Algorithms and complexity
Sébastien Bubeck · 2015
Cited alongside, same era.
Global convergence of the heavy-ball method for convex optimization
Euhanna Ghadimi, Hamid Reza Feyzmahdavian, and Mikael Johansson · 2015
Cited alongside, same era.
On lower and upper bounds in smooth and strongly convex optimization
Yossi Arjevani, Shai Shalev-Shwartz, and Ohad Shamir · 2016
Cited alongside, same era.
An introduction to continuous optimization for imaging
Antonin Chambolle and Thomas Pock · 2016
Cited alongside, same era.
Analysis and design of optimization algorithms via integral quadratic constraints
Laurent Lessard, Benjamin Recht, and Andrew Packard · 2016
MOSEK Optimizer API for C 9.3.6
MOSEK ApS · 2019
Later among the works it cites.
Potential-function proofs for gradient methods
Nikhil Bansal and Anupam Gupta · 2019
Later among the works it cites.
Worst-case convergence analysis of inexact gradient and newton methods through semidefinite programming performance estimation
Etienne De Klerk, Francois Glineur, and Adrien B Taylor · 2020
Later among the works it cites.
Optimal complexity and certification of Bregman first-order methods
Radu-Alexandru Dragomir, Adrien B. Taylor, Alexandre d’Aspremont, and Jérôme Bolte · 2021
Later among the works it cites.
First-order methods for convex optimization
Pavel Dvurechensky, Shimrit Shtern, and Mathias Staudigl · 2021
Later among the works it cites.
Acceleration methods
Alexandre d’Aspremont, Damien Scieur, and Adrien Taylor · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A three-operator splitting scheme and its optimization applications
Damek Davis and Wotao Yin · 2017
Cited alongside, same era.
Exact worst-case performance of first-order methods for composite convex optimization
Adrien B. Taylor, Julien M. Hendrickx, and François Glineur · 2017
Cited alongside, same era.
Performance estimation toolbox (PESTO): automated worst-case analysis of first-order optimization methods
Adrien B. Taylor, Julien M. Hendrickx, and François Glineur · 2017
Cited alongside, same era.
Smooth strongly convex interpolation and exact worst-case performance of first-order methods
Adrien B. Taylor, Julien M. Hendrickx, and François Glineur · 2017
Cited alongside, same era.
Lyapunov functions for first-order methods: Tight automated convergence guarantees
Adrien Taylor, Bryan Van Scoy, and Laurent Lessard · 2018
Cited alongside, same era.
A frequency-domain analysis of inexact gradient methods
Oran Gannot · 2022
Later among the works it cites.
PEPit: computer-assisted worst-case analyses of first-order optimization methods in Python
Baptiste Goujaud, Céline Moucer, François Glineur, Julien Hendrickx, Adrien Taylor, and Aymeric Dieuleveut · 2022
Later among the works it cites.
Optimal first-order methods for convex functions with a quadratic upper bound
Baptiste Goujaud, Adrien Taylor, and Aymeric Dieuleveut · 2022
Later among the works it cites.
Gradient descent is optimal under lower restricted secant inequality and upper error bound
Charles Guille-Escuret, Baptiste Goujaud, Adam Ibrahim, and Ioannis Mitliagkas · 2022
Later among the works it cites.
Automated tight Lyapunov analysis for first-order methods
Manu Upadhyaya, Sebastian Banert, Adrien B. Taylor, and Pontus Giselsson · 2023
Closest in time.