nesterov-convergence-rate-optimal

IN premise — entries/2026/06/21/wiki-Gradient_descent-chunk-4.md

Created 2026-06-21T09:55:50+00:00

Nesterov accelerated gradient achieves O(k^-2) convergence rate for convex Lipschitz-smooth objectives, improving over standard gradient descent's O(k^-1), and this is optimal for first-order methods