Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization

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

• Gene Yang

related reading

• [2605.15522] Stochastic Non-Smooth Convex Optimization with Unbounded Gradientsarxiv.org
• [1605.08101] Global rates of convergence for nonconvex optimization on manifoldsarxiv.org
• [2605.01172] A Theory of Generalization in Deep Learningarxiv.org
• prox_algs.pdfweb.stanford.edu
• bv_cvxbook.pdfweb.stanford.edu
• An optimization perspective on log-concave sampling and beyond | Sinho Chewichewisinho.github.io
• [2604.04891] Muon Dynamics as a Spectral Wasserstein Flowarxiv.org
• Trust_Region_Methods.pdfjubayer-ibn-hamid.github.io
• SIAG on Optimization Views and News 33(1)siagoptimization.github.io
• arxiv.org/pdf/1805.08522arxiv.org
• [1907.03452] Deep splitting method for parabolic PDEsarxiv.org
• bv_cvxbook.pdfstanford.edu