Nesterov Flow May Travel Infinitely Long to Converge to a Minimizer

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Ryu, Ernest K.
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866908946139185152
author Ryu, Ernest K.
author_facet Ryu, Ernest K.
contents Recent work has established that the trajectory of the Nesterov ODE, a the continuous-time model of Nesterov's accelerated gradient method, exhibits point convergence towards a minimizer of a convex potential. A natural next question is whether this point convergence can be upgraded to rectifiability, namely whether the convergent orbit has finite path length. This work provides the answer in the negative by constructing a differentiable convex potential in $\mathbb{R}^2$ for which the flow converges to its minimizer but still accumulates infinite path length. All proofs of this work are due entirely to an internal model at OpenAI.
format Preprint
id arxiv_https___arxiv_org_abs_2604_06651
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Nesterov Flow May Travel Infinitely Long to Converge to a Minimizer
Ryu, Ernest K.
Optimization and Control
Recent work has established that the trajectory of the Nesterov ODE, a the continuous-time model of Nesterov's accelerated gradient method, exhibits point convergence towards a minimizer of a convex potential. A natural next question is whether this point convergence can be upgraded to rectifiability, namely whether the convergent orbit has finite path length. This work provides the answer in the negative by constructing a differentiable convex potential in $\mathbb{R}^2$ for which the flow converges to its minimizer but still accumulates infinite path length. All proofs of this work are due entirely to an internal model at OpenAI.
title Nesterov Flow May Travel Infinitely Long to Converge to a Minimizer
topic Optimization and Control
url https://arxiv.org/abs/2604.06651