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, alongside 17 external citations. Polarity classification is still indexing.
2
Pith papers citing it
17
external citations · OpenAlex
fields
math.OC 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Two restart-free accelerated first-order methods for nonconvex functions with Lipschitz gradients and Hessians achieve O(ε^{-7/4}) complexity by discretizing a new ODE model, with adaptive Lipschitz estimation in one variant.
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.
-
A Restart-Free Accelerated Algorithm for Non-Convex Minimization: Continuous and Discrete Analysis
Two restart-free accelerated first-order methods for nonconvex functions with Lipschitz gradients and Hessians achieve O(ε^{-7/4}) complexity by discretizing a new ODE model, with adaptive Lipschitz estimation in one variant.