Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
arxiv.org · 7,420 words · saved by 1 readers
N/A
Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization arXiv:2509.20902v1 [math.OC] 25 Sep 2025 Yurii Nesterov ∗ September 25, 2025 Abstract In this paper, we provide the universal first-order methods of…
saved by
related reading
- [2605.15522] Stochastic Non-Smooth Convex Optimization with Unbounded Gradientsarxiv.org
- bv_cvxbook.pdfweb.stanford.edu
- [1605.08101] Global rates of convergence for nonconvex optimization on manifoldsarxiv.org
- bv_cvxbook.pdfstanford.edu
- Why Momentum Really Worksdistill.pub
- Deriving Muonjeremybernste.in
- SIAG on Optimization Views and News 33(1)siagoptimization.github.io
- Mathematical optimization - Wikipediaen.wikipedia.org
- Effortless optimization through gradient flows – Machine Learning Research Blogfrancisbach.com
- On the Link Between Polynomials and Optimization, Part 1fa.bianp.net
- An optimization perspective on log-concave sampling and beyond | Sinho Chewichewisinho.github.io
- Tropical Gradient Descentarxiv.org