The First Optimal Acceleration of High-Order Methods in Smooth Convex Optimization

The extragradient method for finding saddle points and other problems

Korpelevich, G. M. (1976) · 1976

Earlier work this paper cites.

Problem complexity and method efficiency in optimization

Nemirovskij, A. S. and Yudin, D. B. (1983) · 1983

Earlier work this paper cites.

A method for solving the convex programming problem with convergence rate o (1/kˆ 2)

Nesterov, Y. E. (1983) · 1983

Earlier work this paper cites.

Introductory lectures on convex optimization: A basic course

Nesterov, Y. (2003) · 2003

Earlier work this paper cites.

Cubic regularization of newton method and its global performance

Nesterov, Y. and Polyak, B. T. (2006) · 2006

Cited alongside, same era.

Accelerating the cubic regularization of newton’s method on convex problems

Nesterov, Y. (2008) · 2008

Cited alongside, same era.

An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods

Monteiro, R. D. and Svaiter, B. F. (2013) · 2013

Cited alongside, same era.

Lower bounds for higher-order convex optimization

Agarwal, N. and Hazan, E. (2018) · 2018

Cited alongside, same era.

Optimal tensor methods in smooth convex and uniformly convexoptimization

Gasnikov, A., Dvurechensky, P., Gorbunov, E., Vorontsova, E., Selikhanovych, D., and Uribe, C. A. (2019a)

Cited in the paper.

Near optimal methods for minimizing convex functions with lipschitz p p -th derivatives

Gasnikov, A., Dvurechensky, P., Gorbunov, E., Vorontsova, E., Selikhanovych, D., Uribe, C. A., Jiang, B., Wang, H., Zhang, S., Bubeck, S., et al. (2019b)

Cited in the paper.

Implementable tensor methods in unconstrained convex optimization

Nesterov, Y. (2021a)

Cited in the paper.

Inexact high-order proximal-point methods with auxiliary search procedure

Nesterov, Y. (2021b)

Cited in the paper.

Oracle complexity of second-order methods for smooth convex optimization

Arjevani, Y., Shamir, O., and Shiff, R. (2019) · 2019

Later among the works it cites.

Near-optimal method for highly smooth convex optimization

Bubeck, S., Jiang, Q., Lee, Y. T., Li, Y., and Sidford, A. (2019) · 2019

Later among the works it cites.

An optimal high-order tensor method for convex optimization

Jiang, B., Wang, H., and Zhang, S. (2019) · 2019

Later among the works it cites.