A Note on Nesterov's Accelerated Method in Nonconvex Optimization: a Weak Estimate Sequence Approach

Gradient methods for the minimisation of functionals

Original

Boris T Polyak · 1963

Earlier work this paper cites.

A method for solving the convex programming problem with convergence rate o ⁡ ( 1 / k 2 ) o(1/k^{2})

Yurii Nesterov · 1983

Earlier work this paper cites.

Introductory Lectures on Convex Optimization: A Basic Course

Yurii Nesterov · 2004

Earlier work this paper cites.

Sequential Subspace Optimization Method for Large-scale Unconstrained Problems

Guy Narkiss and Michael Zibulevsky · 2005

Earlier work this paper cites.

Gradient descent learns linear dynamical systems

Original

Moritz Hardt, Tengyu Ma, and Benjamin Recht · 2016

Cited alongside, same era.

Linear convergence of gradient and proximal-gradient methods under the polyak-łojasiewicz condition

Hamed Karimi, Julie Nutini, and Mark Schmidt · 2016

Cited alongside, same era.

Accelerated methods for α \alpha -weakly-quasi-convex problems

Original

Sergey Guminov and Alexander Gasnikov · 2017

Cited alongside, same era.

An optimal first order method based on optimal quadratic averaging

Dmitriy Drusvyatskiy, Maryam Fazel, and Scott Roy · 2018

Cited alongside, same era.

Global convergence of policy gradient methods for the linear quadratic regulator

Maryam Fazel, Rong Ge, Sham Kakade, and Mehran Mesbahi · 2018

Later among the works it cites.

LQR through the lens of first order methods: Discrete-time case

Original

Jingjing Bu, Afshin Mesbahi, Maryam Fazel, and Mehran Mesbahi · 2019

Later among the works it cites.

Near-optimal methods for minimizing star-convex functions and beyond

Original

Oliver Hinder, Aaron Sidford, and Nimit S. Sohoni · 2019

Later among the works it cites.

Primal-dual accelerated gradient methods with small-dimensional relaxation oracle

Original

Yurii Nesterov, Alexander Gasnikov, Sergey Guminov, and Pavel Dvurechensky · 2019

Later among the works it cites.