There exists a differentiable convex potential in R^2 such that the Nesterov ODE converges to the minimizer along a trajectory of infinite path length.
arXiv:2510.22715 (2025)
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
fields
math.OC 5years
2026 5representative citing papers
APAPC integrates Nesterov acceleration into primal-dual forward-backward schemes by exploiting dual strong convexity to achieve optimal sublinear and accelerated linear convergence rates.
The accelerated backward-forward method achieves O(1/k²) convergence on convex composite problems and accelerated linear convergence when the smooth component is strongly convex.
citing papers explorer
-
Nesterov Flow May Travel Infinitely Long to Converge to a Minimizer
There exists a differentiable convex potential in R^2 such that the Nesterov ODE converges to the minimizer along a trajectory of infinite path length.
-
A Nesterov-Accelerated Primal-Dual Splitting Algorithm for Convex Nonsmooth Optimization
APAPC integrates Nesterov acceleration into primal-dual forward-backward schemes by exploiting dual strong convexity to achieve optimal sublinear and accelerated linear convergence rates.
-
Accelerated Backward Forward Method for Convex Optimization
The accelerated backward-forward method achieves O(1/k²) convergence on convex composite problems and accelerated linear convergence when the smooth component is strongly convex.
- Convergence of iterates and improved rates for accelerated augmented Lagrangian methods for linearly constrained convex optimization
- Trajectory convergence and $o(t^{-2})$ rates for Nesterov accelerated primal-dual dynamics without Lipschitz gradient assumption