Prox-ITEM achieves the minimax-optimal distance-to-solution rate among span-based first-order methods for smooth strongly convex composite problems, with Prox-TMM as its stationary limit matching TMM rates.
Taylor and Julien M
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
other 1
citation-polarity summary
fields
math.OC 2years
2026 2verdicts
UNVERDICTED 2roles
other 1polarities
unclear 1representative citing papers
Establishes matching Ω(T^{-p/(p-1)}) lower bounds for Frank-Wolfe on p-uniformly convex feasible sets for p ≥ 3, plus extension to Hölderian error bounds.
citing papers explorer
-
An optimal first-order method for smooth and strongly convex composite optimization and its stationary limit
Prox-ITEM achieves the minimax-optimal distance-to-solution rate among span-based first-order methods for smooth strongly convex composite problems, with Prox-TMM as its stationary limit matching TMM rates.
-
Curvature-Dependent Lower Bounds for Frank-Wolfe
Establishes matching Ω(T^{-p/(p-1)}) lower bounds for Frank-Wolfe on p-uniformly convex feasible sets for p ≥ 3, plus extension to Hölderian error bounds.