MathDB1 problem
- 0 votes0 replies0 views
Necessity of Lipschitz continuity for universality in strongly convex optimization
Consider deterministic strongly convex optimization, where an algorithm is called universal if it achieves the relevant near-optimal convergence rates without prior knowledge of pr…