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 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
APAPC integrates Nesterov acceleration into primal-dual forward-backward schemes by exploiting dual strong convexity to achieve optimal sublinear and accelerated linear convergence rates.
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 Nesterov-Accelerated Primal-Dual Splitting Algorithm for Convex Nonsmooth Optimization
APAPC integrates Nesterov acceleration into primal-dual forward-backward schemes by exploiting dual strong convexity to achieve optimal sublinear and accelerated linear convergence rates.