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.
Mathematical Programming190(1), 57–87 (2021)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
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.