On the order of the operators in the Douglas-Rachford algorithm

DOI10.1007/s11590-015-0920-5zbMath1346.47015arXiv1505.02796OpenAlexW1929806008MaRDI QIDQ279805

Heinz H. Bauschke, Walaa M. Moursi

Publication date: 29 April 2016

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.02796

zbMATH Keywords

fixed pointprojection operatormaximally monotone operatoraffine subspaceAttouch-Théra dualityDouglas-Rachford splitting operatornormal cone operator

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Monotone operators and generalizations (47H05) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Decomposition methods (49M27)

Related Items (10)

A Parallel Douglas–Rachford Algorithm for Minimizing ROF-like Functionals on Images with Values in Symmetric Hadamard Manifolds ⋮ Local convergence properties of Douglas-Rachford and alternating direction method of multipliers ⋮ Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions ⋮ A Lyapunov function construction for a non-convex Douglas-Rachford iteration ⋮ A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting ⋮ On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces ⋮ The Douglas-Rachford algorithm in the affine-convex case ⋮ On the Behavior of the Douglas--Rachford Algorithm for Minimizing a Convex Function Subject to a Linear Constraint ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD ⋮ Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming

Uses Software

• GeoGebra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces
• Linear and strong convergence of algorithms involving averaged nonexpansive operators
• Firmly nonexpansive mappings and maximally monotone operators: correspondence and duality
• Attouch-Théra duality revisited: Paramonotonicity and operator splitting
• Recent results on Douglas-Rachford methods for combinatorial optimization problems
• A primal-dual projection method for solving systems of linear inequalities
• A cyclic Douglas-Rachford iteration scheme
• The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
• Global convergence of a non-convex Douglas-Rachford iteration
• A family of projective splitting methods for the sum of two maximal monotone operators
• Linear convergence of the Douglas–Rachford method for two closed sets
• The Douglas–Rachford Algorithm in the Absence of Convexity
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Variational Analysis
• Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems
• Self Equivalence of the Alternating Direction Method of Multipliers
• Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: On the order of the operators in the Douglas-Rachford algorithm