Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02) History of calculus of variations and optimal control (49-03) Set-valued and variational analysis (49J53) Numerical methods in optimal control (49M99)
Abstract: The Douglas--Rachford method is a splitting method frequently employed for finding zeroes of sums of maximally monotone operators. When the operators in question are normal cones operators, the iterated process may be used to solve feasibility problems of the form: Find The success of the method in the context of closed, convex, nonempty sets is well-known and understood from a theoretical standpoint. However, its performance in the nonconvex context is less understood yet surprisingly impressive. This was particularly compelling to Jonathan M. Borwein who, intrigued by Elser, Rankenburg, and Thibault's success in applying the method for solving Sudoku Puzzles, began an investigation of his own. We survey the current body of literature on the subject, and we summarize its history. We especially commemorate Professor Borwein's celebrated contributions to the area.
Recommendations
- Developments in Survey Research over the Past 60 Years: A Personal Perspective
- Sixty years of percolation
- Sixty years of Professor Vlastimil Dlab
- scientific article; zbMATH DE number 5903102
- Some lessons from sixty years of theorizing
- Sixty years of Professor Valter Šeda
- Seventy years of Rajchman measures
- Reflections on 50 Years of Constructive Research
- scientific article; zbMATH DE number 5360334
Cites work
- A cyclic Douglas-Rachford iteration scheme
- A Douglas--Rachford Type Primal-Dual Method for Solving Inclusions with Mixtures of Composite and Parallel-Sum Type Monotone Operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A family of projective splitting methods for the sum of two maximal monotone operators
- A feasibility approach for constructing combinatorial designs of circulant type
- 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
- A new proximal point iteration that converges weakly but not in norm
- A relaxed projection method for variational inequalities
- A weakly convergent fully inexact Douglas-Rachford method with relative error tolerance
- About intrinsic transversality of pairs of sets
- About regularity of collections of sets
- Adaptive Douglas-Rachford splitting algorithm for the sum of two operators
- Affine nonexpansive operators, Attouch-Théra duality and the Douglas-Rachford algorithm
- Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
- An alternating projection that does not converge in norm
- An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm
- Application of projection algorithms to differential equations: boundary value problems
- Attouch-Théra duality revisited: Paramonotonicity and operator splitting
- Benchmark problems for phase retrieval
- Circumcentering the Douglas-Rachford method
- Comparing averaged relaxed cutters and projection methods: theory and examples
- Computing the resolvent of the sum of maximally monotone operators with the averaged alternating modified reflections algorithm
- Convergence rate analysis for averaged fixed point iterations in common fixed point problems
- Convergence rate analysis of several splitting schemes
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex analysis and nonlinear optimization. Theory and examples.
- Convex optimization algorithms
- Decomposition through formalization in a product space
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
- Douglas-Rachford feasibility methods for matrix completion problems
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Douglas-Rachford splitting for the sum of a Lipschitz continuous and a strongly monotone operator
- Dynamics of the Douglas-Rachford method for ellipses and p-spheres
- Ergodic behaviour of a Douglas-Rachford operator away from the origin
- Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Finding maximum rank moment matrices by facial reduction on primal form and Douglas-Rachford iteration
- Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions
- From parallel to sequential projection methods and vice versa in convex feasibility: Results and conjectures.
- General Projective Splitting Methods for Sums of Maximal Monotone Operators
- Generalized solutions for the sum of two maximally monotone operators
- Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
- Global convergence of a non-convex Douglas-Rachford iteration
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 1003727 (Why is no real title available?)
- scientific article; zbMATH DE number 6836855 (Why is no real title available?)
- scientific article; zbMATH DE number 3148887 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 2067645 (Why is no real title available?)
- scientific article; zbMATH DE number 3441150 (Why is no real title available?)
- scientific article; zbMATH DE number 3229228 (Why is no real title available?)
- scientific article; zbMATH DE number 3398324 (Why is no real title available?)
- Inertial Douglas-Rachford splitting for monotone inclusion problems
- Iterative methods for fixed point problems in Hilbert spaces
- ITERATIVE PROJECTION AND REFLECTION METHODS: THEORY AND PRACTICE
- Linear and strong convergence of algorithms involving averaged nonexpansive operators
- Linear Convergence and Metric Selection for Douglas-Rachford Splitting and ADMM
- Linear convergence of projection algorithms
- Linear convergence of the Douglas-Rachford method for two closed sets
- Local linear convergence for alternating and averaged nonconvex projections
- Matrix product constraints by projection methods
- Monotone Operators and the Proximal Point Algorithm
- New Douglas-Rachford algorithmic structures and their convergence analyses
- Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems
- Norm convergence of realistic projection and reflection methods
- On alternating direction methods of multipliers: a historical perspective
- On Douglas-Rachford operators that fail to be proximal mappings
- On Fejér monotone sequences and nonexpansive mappings
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- On Projection Algorithms for Solving Convex Feasibility Problems
- On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- On the asymptotic behaviour of the Aragón Artacho-Campoy algorithm
- On the convergence rate of Douglas-Rachford operator splitting method
- On the Douglas-Rachford algorithm
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the finite convergence of the Douglas-Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces
- On the linear convergence of the circumcentered-reflection method
- On the local convergence of the Douglas-Rachford algorithm
- On the maximality of the sum of two maximal monotone operators
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- On the order of the operators in the Douglas-Rachford algorithm
- On the range of the Douglas-Rachford operator
- On weak convergence of the Douglas-Rachford method
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
- Partial inverse of a monotone operator
- Proximal point algorithm, Douglas-Rachford algorithm and alternating projections: a case study
- Proximal splitting methods in signal processing
- Recent results on Douglas-Rachford methods for combinatorial optimization problems
- Recent results on Douglas-Rachford methods.
- Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination
- Removing multiplicative noise by Douglas-Rachford splitting methods
- Searching with iterated maps
- Solving graph coloring problems with the Douglas-Rachford algorithm
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Splitting Methods in Communication, Imaging, Science, and Engineering
- Stadium norm and Douglas-Rachford splitting: a new approach to road design optimization
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping
- The Complexity of Bit Retrieval
- The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators
- The Douglas-Rachford algorithm for a hyperplane and a doubleton
- The Douglas-Rachford algorithm for the case of the sphere and the line
- The Douglas-Rachford algorithm for two (not necessarily intersecting) affine subspaces
- The Douglas-Rachford algorithm in the absence of convexity
- The Douglas-Rachford algorithm in the affine-convex case
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem
- The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
- The Split Bregman Method for L1-Regularized Problems
- Tight global linear convergence rate bounds for Douglas-Rachford splitting
- Understanding the convergence of the alternating direction method of multipliers: theoretical and computational perspectives
Cited in
(17)- The strong convergence of Douglas-Rachford methods for the split feasibility problem
- Circumcentering reflection methods for nonconvex feasibility problems
- The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
- Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems
- The Douglas-Rachford algorithm for a hyperplane and a doubleton
- Application of projection algorithms to differential equations: boundary value problems
- Reflection-based technique for synthesis of structured controllers with guaranteed local convergence
- Toward a mathematical theory of the crystallographic phase retrieval problem
- Recent results on Douglas-Rachford methods.
- Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions
- The double-relaxation modulus-based matrix splitting iteration method for linear complementarity problems
- On the centralization of the circumcentered-reflection method
- Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
- Extrapolated plug-and-play three-operator splitting methods for nonconvex optimization with applications to image restoration
- The geometry of monotone operator splitting methods
- On pseudoinverse-free randomized methods for linear systems: unified framework and acceleration
- Circumcentered reflections method for wavelet feasibility problems
This page was built for publication: SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4992365)
