A Proof of Exact Convergence Rate of Gradient Descent. Part I. Performance Criterion ∇ f(xN)2/(f(x0)-f*)

Abstract

We prove the exact worst-case convergence rate of gradient descent for smooth strongly convex optimization, with respect to the performance criterion ∇ f(xN)2/(f(x0)-f*). The proof differs from the previous one by Rotaru et al. [RGP24], and is based on the performance estimation methodology [DT14].

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…