Negative momentum enables global convergence in convex-concave min-max optimization and accelerated rates in the strongly-convex-strongly-concave setting.
A method of solving a convex programming problem with convergence rateO(1/k 2)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Negative Momentum for Convex-Concave Optimization
Negative momentum enables global convergence in convex-concave min-max optimization and accelerated rates in the strongly-convex-strongly-concave setting.