Weak convergence on Douglas-Rachford method

2010/07/13 by B. F. Svaiter, Svaiter, B. F. · 7 citations
Computer Science · Mathematics · #47H05 #47N10 #49J52 #FOS: Mathematics #Fixed Point Theorems Analysis #Functional Analysis (math.FA) #Numerical methods in inverse problems #Optimization and Control (math.OC) #Optimization and Variational Analysis

paper · pdf · doi:10.48550/arxiv.1007.2173

openalex publication_date 2010/07/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We prove that the sequences generate by the Douglas-Rachford method converge weakly to a solution of the inclusion problem

Citations

• Splitting Algorithms for the Sum of Two Nonlinear Operators

Cited by

• Linear convergence of relocated fixed-point iterations
• Characterizing Maximal Monotone Operators with Unique Representation
• A primal-dual splitting algorithm with convex combination and larger step sizes for composite monotone inclusion problems
• A note on the Davis-Yin three-operator splitting method
• Bregman Douglas-Rachford Splitting Method
• A splitting algorithm for system of composite monotone inclusions
• Relocated Fixed-Point Iterations with Applications to Variable Stepsize Resolvent Splitting

Related

• A simplified proof of weak convergence in Douglas-Rachford method to a\n solution of the unnderlying inclusion problem
• A weakly convergent fully inexact Douglas-Rachford method with relative\n error tolerance
• The Douglas--Rachford Algorithm Converges Only Weakly
• On the Douglas-Rachford algorithm for solving possibly inconsistent optimization problems
• Linear Convergence of the Douglas-Rachford Method for Two Closed Sets