The ergodic (averaged) sequence of the semi-proximal Peaceman-Rachford splitting method converges to a solution of convex optimization problems with an O(1/k) complexity bound.
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
-
Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
The ergodic (averaged) sequence of the semi-proximal Peaceman-Rachford splitting method converges to a solution of convex optimization problems with an O(1/k) complexity bound.