A triple-Bregman balanced primal-dual algorithm for saddle point problems achieves O(1/N) ergodic convergence, allows larger step sizes than PDHG in a Euclidean setting, and has accelerated variants under strong convexity.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Triple-Bregman Balanced Primal-Dual Algorithm for Saddle Point Problems
A triple-Bregman balanced primal-dual algorithm for saddle point problems achieves O(1/N) ergodic convergence, allows larger step sizes than PDHG in a Euclidean setting, and has accelerated variants under strong convexity.