Smooth Strongly Convex Interpolation and Exact Worst-case Performance of First-order Methods: A Fixed-Step Method's Worst Case over F_{μ,L}(ℝ^d), d ≥ N+2, Equals the Value of (sdp-PEP)Research Paper
Analysts of first-order optimization methods often know how quickly an error bound decreases as the number of iterations grows, but the bound may leave a substantial gap from the method's actual worst case at a fixed iteration count. This matters when comparing concrete methods or step sizes: an asymptotic rate alone does not determine which method has the…