Fetching the paper…
Reading the bibliography…
We propose a near-optimal method for highly smooth convex optimization.
Orth-method for smooth convex optimization
A. Nemirovski · 1982
Earlier work this paper cites.
Problem Complexity and Method Efficiency in Optimization
A. Nemirovski and D. Yudin · 1983
Earlier work this paper cites.
A method of solving a convex programming problem with convergence rate o( 1 / k 2 1/k^{2} )
Y. Nesterov · 1983
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course
Y. Nesterov · 2004
Earlier work this paper cites.
An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
R. D. C. Monteiro and B. F. Svaiter · 2013
Cited alongside, same era.
Lower bounds for higher-order convex optimization
N. Agarwal and E. Hazan · 2018
Cited alongside, same era.
Oracle complexity of second-order methods for smooth convex optimization
Y. Arjevani, O. Shamir, and R. Shiff · 2018
Cited alongside, same era.
The global rate of convergence for optimal tensor methods in smooth convex optimization
A. Gasnikov, E. Gorbunov, D. Kovalev, A. Mohhamed, and E. Chernousova · 2018
Closest in time.
An optimal high-order tensor method for convex optimization
B. Jiang, H. Wang, and S. Zhang · 2018
Closest in time.
Implementable tensor methods in unconstrained convex optimization
Y. Nesterov · 2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…