FDR achieves the optimal O(1/N^2) rate with improved constants for proximal minimization of convex plus strongly convex functions and proves a matching lower bound.
Bulletin of the American Mathematical Society73(6), 957–961 (1967)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
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.
citing papers explorer
-
Optimal Acceleration for Proximal Minimization of the Sum of Convex and Strongly Convex Functions
FDR achieves the optimal O(1/N^2) rate with improved constants for proximal minimization of convex plus strongly convex functions and proves a matching lower bound.
-
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.