Preprint
Jul 2026
Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values
A lower bound of $\Omega(\,\frac{d^2}{\log(d+1)})$ on the oracle complexity in this setting is provided, to close this gap dating back to 1996, up to polylogarithmic factors.
Phillip A. Kerger
· 2 citations
· ⚡1