Radius Free Generalized Accelerated — Generalized Smooth Convex Minimization
Descriptions may be stale. Consult the linked Lean sources.
Generalized Smooth Convex Minimization · Lean proof
Generalized Smooth Convex Minimization
We consider minimizing a convex function
The optimization problem is
Our assumptions:
Assumption 1 (Convexity). For every
Assumption 2 (Generalized smoothness). The function
Assumption 3 (Initial distance). There exists
Queries may be made at any point of
Proved result
OracleTemplate.Convergence LongTails.Setups.RadiusOnlyGeneralizedSmoothConvex.spec
OracleTemplate.RadiusFreeSherpa.budgetRelevant previous results
- Mikhail Rudomanov, Ivan Fomin, Alexander V. Gasnikov, and Fedor S.
Stonyakin. Descending
Everest with First-Order Oracles: Oracle Complexity of Convex
Optimization under
-Smoothness. 2026 (preprint v1, October 15). Complexity: exact-gradient oracle calls, including initialization and line searches, for objective gap at most ; SHERPA followed by CRUISE.