Establish a matching lower bound for a known initial optimality gap

Establish a lower bound matching the dependence on the known initial optimality-gap bound $\Delta$ for the class $\mathcal P_\Delta$ when $4\varepsilon<\Delta<\frac{L_0}{L_1^2}(e^{L_1R}-1-L_1R)$, and determine the exact complexity dependence on $\Delta/\varepsilon$ when $\varepsilon<\Delta<4\varepsilon$.

Background

The paper studies the class PΔ\mathcal P_\Delta of convex (L0,L1)(L_0,L_1)-smooth functions whose initial optimality gap is at most a known value Δ\Delta. It proves matching bounds up to logarithmic factors when Δ=4ε\Delta=4\varepsilon, but for larger gaps only an upper bound is obtained. The paper identifies two unresolved ranges: intermediate gaps between 4ε4\varepsilon and the radial growth bound, and gaps between ε\varepsilon and 4ε4\varepsilon, for which the exact complexity dependence has not been determined.

References

A matching lower bound in terms of the dependence on $\Delta$ is unknown. The exact dependence of the complexity on $\Delta/\varepsilon$ for $\varepsilon<\Delta<4\varepsilon$ is not established either.

— Descending Everest with First-Order Oracles: Oracle Complexity of Convex Optimization under $(L_0,L_1)$-Smoothness  (2610.21461 - Rudomanov et al., 15 Oct 2026) in Section 5, Conclusion and open questions, bullet “Known bound on the optimality gap”