math.OCOct 23, 2026

When Are Nesterov Trajectories Eventually Locally Minimizing?

Authors: Peyman Morteza, Stephen Wright

Organizations: Department of Computer Sciences University of Wisconsin–Madison

Abstract

We revisit the variational characterization of Nesterov's celebrated method and study when Nesterov trajectories are eventually locally minimizing in a variational sense, a notion that we define precisely. We show that this question is equivalent to the nonnegativity of an associated Schrödinger operator acting on variations of the trajectory. For power objectives of the form

f(x)=1p∥x∥pf(x)=\frac{1}{p}\|x\|^p

(where ∥⋅∥\| \cdot\| denotes the Euclidean norm), we give a complete characterization: Among all exponents p≥2p\ge 2, the Nesterov trajectory with non-zero initial position is eventually locally minimizing if and only if p=4p=4. We further interpret this exceptional exponent through the stability theory of semilinear elliptic equations.

Explore similar work

CardsList
  1. Accelerated Gradient Methods for Nonconvex Optimization: Escape Trajectories From Strict Saddle Points and Convergence to Local Minima

    Jul 13, 2023Rishabh Dixit, Mert Gurbuzbalaban, Waheed U. BajwaNonconvex OptimizationAccelerated Gradient Methods