ME achieves linear convergence for any differentiable strongly convex objective by centering iterates inside carefully chosen ellipses.
Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization Mathematical Programming, 149(1-2):1–45
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Method of Ellipcenters for strongly convex minimization
ME achieves linear convergence for any differentiable strongly convex objective by centering iterates inside carefully chosen ellipses.