On the Douglas-Rachford algorithm

DOI10.1007/s10107-016-1086-3OpenAlexW2962916293MaRDI QIDQ2364494

Heinz H. Bauschke, Walaa M. Moursi

Publication date: 21 July 2017

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

weak convergencenonexpansive mappingmaximally monotone operatorAttouch-Théra dualityDouglas-Rachford algorithmparamonotone operatorinconsistent casesum problem

Mathematics Subject Classification ID

Convex programming (90C25) Numerical methods involving duality (49M29) Monotone operators and generalizations (47H05) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Duality theory (optimization) (49N15) Decomposition methods (49M27)

Related Items

Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems, Circumcentering the Douglas-Rachford method, Solving graph coloring problems with the Douglas-Rachford algorithm, Dynamics of the Douglas-Rachford method for ellipses and \(p\)-spheres, A product space reformulation with reduced dimension for splitting algorithms, Unnamed Item, On the minimal displacement vector of the Douglas-Rachford operator, On the circumcentered-reflection method for the convex feasibility problem, On the linear convergence of the circumcentered-reflection method, A parameterized Douglas-Rachford algorithm, The Douglas-Rachford algorithm for convex and nonconvex feasibility problems, Computing the resolvent of the sum of maximally monotone operators with the averaged alternating modified reflections algorithm, The Douglas-Rachford algorithm for a hyperplane and a doubleton, Unrestricted Douglas-Rachford algorithms for solving convex feasibility problems in Hilbert space, Douglas–Rachford algorithm for control-constrained minimum-energy control problems, Mathematical modeling of plasma transport in a helical magnetic field, Primal-dual splittings as fixed point iterations in the range of linear operators, The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators, A nonsmooth Newton method for the design of state feedback stabilizers under structure constraints, On the asymptotic behavior of the Douglas-Rachford and proximal-point algorithms for convex optimization, Douglas-Rachford splitting algorithm for solving state-dependent maximal monotone inclusions, Strengthened splitting methods for computing resolvents, A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting, A new projection method for finding the closest point in the intersection of convex sets, General splitting methods with linearization for the split feasibility problem, Infeasibility detection in the alternating direction method of multipliers for convex optimization, Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems, Convex combination of alternating projection and Douglas-Rachford operators for phase retrieval, Douglas-Rachford splitting and ADMM for pathological convex optimization, Splitting with Near-Circulant Linear Systems: Applications to Total Variation CT and PET, On the Behavior of the Douglas--Rachford Algorithm for Minimizing a Convex Function Subject to a Linear Constraint, A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs, SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD, Adaptive Douglas--Rachford Splitting Algorithm for the Sum of Two Operators, Reflection-based technique for synthesis of structured controllers with guaranteed local convergence

Uses Software

• GeoGebra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
• 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
• Projection methods for quantum channel construction
• Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
• Fifty years of maximal monotonicity
• Examples of discontinuous maximal monotone linear operators and the solution to a recent problem posed by B.F. Svaiter
• Monotone (nonlinear) operators in Hilbert space
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Image d'une somme d'opérateurs monotones et applications
• Minimax monotonicity
• Affine nonexpansive operators, Attouch-Théra duality and the Douglas-Rachford algorithm
• 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
• Set-valued mappings and enlargement of monotone operators.
• A family of projective splitting methods for the sum of two maximal monotone operators
• From Hahn--Banach to monotonicity
• Asymptotic behavior of contractions in Hilbert space
• On Fej\'er monotone sequences and nonexpansive mappings
• The Douglas--Rachford Algorithm for Two (Not Necessarily Intersecting) Affine Subspaces
• Optik mit GeoGebra
• On Weak Convergence of the Douglas–Rachford Method
• On the Range of the Douglas–Rachford Operator
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• A proximal decomposition method for solving convex variational inverse problems
• A Note on the Paper by Eckstein and Svaiter on “General Projective Splitting Methods for Sums of Maximal Monotone Operators”
• 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
• Searching with iterated maps
• Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
• Generalized Solutions for the Sum of Two Maximally Monotone Operators
• Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping
• Convex analysis and monotone operator theory in Hilbert spaces