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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.OC 2verdicts
UNVERDICTED 2representative citing papers
Parameter-free first-order methods attain optimal oracle complexity O(ε^{-2/(1+3ρ)}) for convex function-constrained optimization under Hölder smoothness by combining modified Polyak steps, Nesterov momentum, and APL level-set methods.
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.
-
Uniformly Optimal and Parameter-free First-order Methods for Convex and Function-constrained Optimization
Parameter-free first-order methods attain optimal oracle complexity O(ε^{-2/(1+3ρ)}) for convex function-constrained optimization under Hölder smoothness by combining modified Polyak steps, Nesterov momentum, and APL level-set methods.