A Robust Accelerated Optimization Algorithm for Strongly Convex Functions

A. Lur’e and V. Postnikov, “On the theory of stability of control systems,”

1944

Earlier work this paper cites.

B. T. Polyak,

1987

Earlier work this paper cites.

A. Megretski and A. Rantzer, “System analysis via integral quadratic constraints,”

1997

Earlier work this paper cites.

Y. Nesterov,

2004

Earlier work this paper cites.

J. Bao and P. L. Lee,

2007

Earlier work this paper cites.

A. d’Aspremont, “Smooth optimization with approximate gradient,”

2008

Earlier work this paper cites.

M. Schmidt, N. L. Roux, and F. R. Bach, “Convergence rates of inexact proximal-gradient methods for convex optimization,” in

2011

Cited alongside, same era.

——, “Intermediate gradient methods for smooth convex problems with inexact oracle,” CORE Discussion Paper 2013/17, Tech. Rep., 2013

2013

Cited alongside, same era.

O. Devolder, F. Glineur, and Y. Nesterov, “First-order methods of smooth convex optimization with inexact oracle,”

2014

Cited alongside, same era.

R. Boczar, L. Lessard, and B. Recht, “Exponential convergence bounds using integral quadratic constraints,” in

2015

Cited alongside, same era.

L. Lessard, B. Recht, and A. Packard, “Analysis and design of optimization algorithms via integral quadratic constraints,”

2016

Cited alongside, same era.

B. Hu and L. Lessard, “Dissipativity theory for Nesterov’s accelerated method,” in

2017

Closest in time.

B. Hu, P. Seiler, and A. Rantzer, “A unified analysis of stochastic optimization methods using jump system theory and quadratic constraints,” in

2017

Closest in time.

E. de Klerk, F. Glineur, and A. B. Taylor, “On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions,”

2017

Closest in time.

——, “Worst-case convergence analysis of gradient and Newton methods through semidefinite programming performance estimation,”

Original

2017

Closest in time.

B. Van Scoy, R. A. Freeman, and K. M. Lynch, “The fastest known globally convergent first-order method for minimizing strongly convex functions,”

2018

Closest in time.