The cyclic Douglas-Rachford method for inconsistent feasibility problems

zbMATH Open1315.47061arXiv1310.2195MaRDI QIDQ5253281FDOQ5253281

Authors: Jonathan M. Borwein, Matthew K. Tam 

Publication date: 5 June 2015

Abstract: We analyse the behaviour of the newly introduced cyclic Douglas-Rachford algorithm for finding a point in the intersection of a finite number of closed convex sets. This work considers the case in which the target intersection set is possibly empty.

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

Recommendations

• On the local convergence of the Douglas-Rachford algorithm
• The Douglas-Rachford algorithm for a hyperplane and a doubleton
• A cyclic Douglas-Rachford iteration scheme
• Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
• The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators

zbMATH Keywords

projectionreflectionconvex feasibility problemcyclic Douglas-Rachford method

Mathematics Subject Classification ID

Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Fixed-point theorems (47H10) Iterative procedures involving nonlinear operators (47J25) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)

Cited In (23)

• Douglas-Rachford splitting and ADMM for pathological convex optimization
• Gearhart-Koshy acceleration for affine subspaces
• The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators
• On the order of the operators in the Douglas-Rachford algorithm
• Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons
• Convergence rate analysis for averaged fixed point iterations in common fixed point problems
• Union averaged operators with applications to proximal algorithms for MIN-convex functions
• Recent results on Douglas-Rachford methods for combinatorial optimization problems
• Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination
• Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
• On the Douglas-Rachford algorithm
• A convergent relaxation of the Douglas-Rachford algorithm
• A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
• The block-wise circumcentered-reflection method
• A successive centralized circumcentered-reflection method for the convex feasibility problem
• Local linear convergence of the ADMM/Douglas-Rachford algorithms without strong convexity and application to statistical imaging
• Constraint reduction reformulations for projection algorithms with applications to wavelet construction
• The Douglas-Rachford algorithm for a hyperplane and a doubleton
• The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
• A cyclic Douglas-Rachford iteration scheme
• On the linear convergence of the circumcentered-reflection method
• On the circumcentered-reflection method for the convex feasibility problem
• New Douglas-Rachford algorithmic structures and their convergence analyses

This page was built for publication: The cyclic Douglas-Rachford method for inconsistent feasibility problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5253281)