The Douglas–Rachford Algorithm in the Absence of Convexity

DOI10.1007/978-1-4419-9569-8_6zbMath1259.90098OpenAlexW1822348607MaRDI QIDQ2897277

Jonathan M. Borwein, Brailey Sims

Publication date: 10 July 2012

Published in: Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4419-9569-8_6

zbMATH Keywords

fixed point theorydynamical systemalternating projection algorithmnonconvex feasibility problem

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical methods based on nonlinear programming (49M37) Fixed-point theorems (47H10) Programming in abstract spaces (90C48) Numerical methods for mathematical programming, optimization and variational techniques (65K99)

Related Items (40)

On the order of the operators in the Douglas-Rachford algorithm ⋮ Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem ⋮ Learning without loss ⋮ Convergence rates with inexact non-expansive operators ⋮ A Parallel Douglas–Rachford Algorithm for Minimizing ROF-like Functionals on Images with Values in Symmetric Hadamard Manifolds ⋮ Circumcentering the Douglas-Rachford method ⋮ Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination ⋮ A remark on the convergence of the Douglas-Rachford iteration in a non-convex setting ⋮ Dynamics of the Douglas-Rachford method for ellipses and \(p\)-spheres ⋮ Circumcentering reflection methods for nonconvex feasibility problems ⋮ DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS ⋮ Local convergence properties of Douglas-Rachford and alternating direction method of multipliers ⋮ On the circumcentered-reflection method for the convex feasibility problem ⋮ Maximum entropy and feasibility methods for convex and nonconvex inverse problems ⋮ Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions ⋮ The Douglas-Rachford algorithm for convex and nonconvex feasibility problems ⋮ Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems ⋮ A weakly convergent fully inexact Douglas-Rachford method with relative error tolerance ⋮ The Douglas-Rachford algorithm for a hyperplane and a doubleton ⋮ Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency ⋮ Global convergence of a non-convex Douglas-Rachford iteration ⋮ Recent results on Douglas-Rachford methods for combinatorial optimization problems ⋮ A Lyapunov function construction for a non-convex Douglas-Rachford iteration ⋮ Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples ⋮ Activity Identification and Local Linear Convergence of Douglas–Rachford/ADMM under Partial Smoothness ⋮ A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting ⋮ Projection methods for quantum channel construction ⋮ A new projection method for finding the closest point in the intersection of convex sets ⋮ A cyclic Douglas-Rachford iteration scheme ⋮ On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces ⋮ New Demiclosedness Principles for (Firmly) Nonexpansive Operators ⋮ New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses ⋮ Linear convergence of the Douglas–Rachford method for two closed sets ⋮ Constraint reduction reformulations for projection algorithms with applications to wavelet construction ⋮ The Douglas-Rachford algorithm for the case of the sphere and the line ⋮ Ergodic behaviour of a Douglas-Rachford operator away from the origin ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD ⋮ APPLICATION OF PROJECTION ALGORITHMS TO DIFFERENTIAL EQUATIONS: BOUNDARY VALUE PROBLEMS ⋮ Solving Nonconvex Feasibility Problem on a Sphere and a Closed Ball by Douglas–Rachford Algorithm ⋮ Reflection-based technique for synthesis of structured controllers with guaranteed local convergence

Uses Software

• Unnamed Item
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
• A multivalued version of Sharkovskiĭ's theorem holds with at most two exceptions
• Full analogy of Sharkovsky's theorem for lower semicontinuous maps
• A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• On Projection Algorithms for Solving Convex Feasibility Problems
• Searching with iterated maps

This page was built for publication: The Douglas–Rachford Algorithm in the Absence of Convexity