arXiv (All)
open access
Near-Optimal Exact-Value Zeroth-Order Complexity for Smooth Strongly Convex Optimization
We study deterministic adaptive optimization of globally $β$-smooth, $μ$-strongly convex functions using exact scalar function values. Queries and outputs lie in $B_2^d(R)$, and the minimizer lies in $B_2^d(R/2)$. Set $κ=β/μ$, $Q=βR^2/ε$, and $D_d=(d/\log(ed))^{1/3}$. For sufficiently large $d$ and
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
- Near-Optimal Deterministic Exact-Value Complexity for Smooth Convex Optimization#1012430
- On the Complexity of BFGS Method for Smooth Convex Optimization#617683
- On the Complexity of BFGS Method for Smooth Convex Optimization#617183
- Exact oracle complexity for function-value suboptimality under weighted initial conditions#1118072
- Sharp First-Order Lower Bounds for Higher-Order Smooth Nonconvex Optimization#1051471
Record · ID 1012895
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