arXiv (All)
open access
On Minimax Optimality and Uniqueness of Fixed-Step First-Order Methods for Smooth Convex Optimization
This paper considers the design of optimal fixed-step first-order methods for high-dimensional minimization of $L$-smooth convex functions. For optimizing worst-case performance measured via suboptimality of the final function value (relative to the initial squared distance to a minimizer), we provi
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
- On the complexity of proximal gradient and proximal gradient-Newton-CG methods for $\ell_1$-regularized Optimization#987427
- A unified vertical alignment and earthwork model in road design with a new convex optimization model for road networks#1110110
- First-Order Optimization under Uniform Nondegeneracy: Geometry, Computation, and Information#975022
- On the minimax-rate optimality of approximate Bayesian computation in nonparametric problems#616798
- On the minimax-rate optimality of approximate Bayesian computation in nonparametric problems#616298
Record · ID 984578
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