Preprint
Aug 2026
Optimal Deterministic Oracle Complexity for Weakly Convex Optimization
It is proved that every deterministic first-order algorithm requires a first-order oracle that returns both the function value and the full subdifferential at every query point, and establishes the optimal deterministic oracle complexity.
Jiajin Li, Siyu Pan
· 1 citation
· ⚡1