On Weak Convergence of the Douglas-Rachford Method

Authors:
B. F. Svaiter
Affiliations:
benar@impa.br
Venue:
SIAM Journal on Control and Optimization
Year:
2011

Citing 5
Cited 3

On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators

Mathematical Programming: Series A and B
Entropy-like proximal methods in convex programming

Mathematics of Operations Research
A family of projective splitting methods for the sum of two maximal monotone operators

Mathematical Programming: Series A and B
General Projective Splitting Methods for Sums of Maximal Monotone Operators

SIAM Journal on Control and Optimization
A Note on the Paper by Eckstein and Svaiter on “General Projective Splitting Methods for Sums of Maximal Monotone Operators”

SIAM Journal on Control and Optimization

Proximal Algorithms for Multicomponent Image Recovery Problems

Journal of Mathematical Imaging and Vision
Full length article: Attouch-Théra duality revisited: Paramonotonicity and operator splitting

Journal of Approximation Theory
A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality

SIAM Journal on Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that the sequences generated by the Douglas-Rachford method converge weakly to zero of the sum of two maximal monotone operators using new tools introduced in recent works of Eckstein and the author. The assumption of maximal monotonicity of the sum is also removed, using a recent result of Bauschke.