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 105 external citations. Polarity classification is still indexing.
2
Pith papers citing it
105
external citations · OpenAlex
fields
math.OC 2years
2026 2representative citing papers
Sparse optimization and SDP-based post-processing of PEP dual certificates recovers compact, interpretable proofs and Lyapunov functions for first-order optimization 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.
-
Finding Simple Proofs for First-Order Optimization
Sparse optimization and SDP-based post-processing of PEP dual certificates recovers compact, interpretable proofs and Lyapunov functions for first-order optimization methods.