arXiv (All)
open access
The exact worst-case asymptotic rate of Nesterov acceleration for strongly convex optimization
We study Nesterov's accelerated gradient method with its standard constant parameters for smooth strongly convex optimization. We characterize the exact worst-case asymptotic factor for the squared distance to the minimizer. To this end, we construct candidate worst-case trajectories by combining pl
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Sharp Minimax Rates for Highly Smooth Strongly Convex Zeroth-Order Optimization#1154899
- Effective curvature dimension in smooth DC optimization#1064922
- On Minimax Optimality and Uniqueness of Fixed-Step First-Order Methods for Smooth Convex Optimization#984578
- A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization#1187210
- Hessian Estimates for Convex Solutions of Hessian Quotient Equations via Compactness#1218177
Record · ID 1326021
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive