Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem

DOI10.1007/s10898-015-0380-6zbMath1338.90310arXiv1506.09026MaRDI QIDQ288229

Matthew K. Tam, Francisco J. Aragón Artacho, Jonathan M. Borwein

Publication date: 25 May 2016

Published in: Journal of Global Optimization (Search for Journal in Brave)

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

zbMATH Keywords

global convergence; half-space; feasibility problem; Douglas-Rachford algorithm; non-convex

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C26: Nonconvex programming, global optimization

Related Items

SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD, Solving Nonconvex Feasibility Problem on a Sphere and a Closed Ball by Douglas–Rachford Algorithm, Ergodic behaviour of a Douglas-Rachford operator away from the origin, Adaptive Douglas--Rachford Splitting Algorithm for the Sum of Two Operators, The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators, On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces, Convergence of an Inertial Shadow Douglas-Rachford Splitting Algorithm for Monotone Inclusions, Unrestricted Douglas-Rachford algorithms for solving convex feasibility problems in Hilbert space, 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, Circumcentering the Douglas-Rachford method, A remark on the convergence of the Douglas-Rachford iteration in a non-convex setting, Solving graph coloring problems with the Douglas-Rachford algorithm, Matrix product constraints by projection methods, A Lyapunov function construction for a non-convex Douglas-Rachford iteration, A feasibility approach for constructing combinatorial designs of circulant type, A unified Douglas-Rachford algorithm for generalized DC programming, An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm, The Douglas-Rachford algorithm for convex and nonconvex feasibility problems, Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems, Douglas-Rachford splitting and ADMM for pathological convex optimization, The Douglas-Rachford algorithm for a hyperplane and a doubleton, Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples

Cites Work

• Unnamed Item
• Recent results on Douglas-Rachford methods for combinatorial optimization problems
• The Douglas-Rachford algorithm for the case of the sphere and the line
• The Douglas-Rachford algorithm in the affine-convex case
• A cyclic Douglas-Rachford iteration scheme
• Global convergence of a non-convex Douglas-Rachford iteration
• On the local convergence of the Douglas-Rachford algorithm
• Linear convergence of the Douglas–Rachford method for two closed sets
• The Douglas–Rachford Algorithm in the Absence of Convexity
• DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS
• Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces
• Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
• 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