Conditions for linear convergence of the gradient method for non-convex optimization

USSR Computational Mathematics and Mathematical Physics 3

Polyak, B.T.: Gradient methods for the minimisation of functionals · 1963

Earlier work this paper cites.

Mathematical Programming 116

Attouch, H., Bolte, J.: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features · 2009

Earlier work this paper cites.

Mathematics of Operations Research 35

Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: An approach based on the Kurdyka-Łojasiewicz inequality · 2010

Earlier work this paper cites.

Mathematical Programming 145

Drori, Y., Teboulle, M.: Performance of first-order methods for smooth convex minimization: a novel approach · 2014

Earlier work this paper cites.

In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp. 795–811. Springer (2016)

Karimi, H., Nutini, J., Schmidt, M.: Linear convergence of gradient and proximal-gradient methods under the Polyak-Łojasiewicz condition · 2016

Earlier work this paper cites.

Optimization Letters 11

De Klerk, E., Glineur, F., Taylor, A.B.: On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions · 2017

Earlier work this paper cites.

Mathematical Programming 161

Taylor, A.B., Hendrickx, J.M., Glineur, F.: Smooth strongly convex interpolation and exact worst-case performance of first-order methods · 2017

Earlier work this paper cites.

Springer (2018)

Nesterov, Y.: Lectures on convex optimization, vol. 137 · 2018

Cited alongside, same era.

Mathematical Programming 184

Carmon, Y., Duchi, J.C., Hinder, O., Sidford, A.: Lower bounds for finding stationary points I · 2019

Cited alongside, same era.

SIAM Journal on Optimization 29

Davis, D., Drusvyatskiy, D.: Stochastic model-based minimization of weakly convex functions · 2019

Cited alongside, same era.

Mathematical Programming 175

Necoara, I., Nesterov, Y., Glineur, F.: Linear convergence of first order methods for non-strongly convex optimization · 2019

Cited alongside, same era.

arXiv preprint arXiv:2006.08548 (2020)

Original

Bu, J., Mesbahi, M.: A note on Nesterov’s accelerated method in nonconvex optimization: a weak estimate sequence approach · 2020

Cited alongside, same era.

arXiv preprint arXiv:2012.06188 (2020)

Original

In: Conference on Learning Theory, pp. 1894–1938. PMLR (2020)

Hinder, O., Sidford, A., Sohoni, N.: Near-optimal methods for minimizing star-convex functions and beyond · 2020

Later among the works it cites.

Optimization Letters pp. 1–13 (2021)

Abbaszadehpeivasti, H., de Klerk, E., Zamani, M.: The exact worst-case convergence rate of the gradient method with fixed step lengths for L-smooth functions · 2021

Later among the works it cites.

arXiv preprint arXiv:2109.13566 (2021)

Original

Abbaszadehpeivasti, H., de Klerk, E., Zamani, M.: On the rate of convergence of the difference-of-convex algorithm (DCA) · 2021

Later among the works it cites.

Mathematical Programming 187

Hu, B., Seiler, P., Lessard, L.: Analysis of biased stochastic gradient descent using sequential semidefinite programs · 2021

Later among the works it cites.

arXiv preprint arXiv:2203.07305 (2022)

Original

Gupta, S.D., Van Parys, B.P., Ryu, E.K.: Branch-and-bound performance estimation programming: A unified methodology for constructing optimal optimization methods · 2022