The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems

From MaRDI portal
Publication:5253281


zbMath1315.47061arXiv1310.2195MaRDI QIDQ5253281

Matthew K. Tam, Jonathan M. Borwein

Publication date: 5 June 2015

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



Related Items

On the order of the operators in the Douglas-Rachford algorithm, On the Douglas-Rachford algorithm, Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem, A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space, Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging, Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination, Gearhart-Koshy acceleration for affine subspaces, On the circumcentered-reflection method for the convex feasibility problem, On the linear convergence of the circumcentered-reflection method, The Douglas-Rachford algorithm for convex and nonconvex feasibility problems, Union averaged operators with applications to proximal algorithms for MIN-convex functions, Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems, The block-wise circumcentered-reflection method, A successive centralized circumcentered-reflection method for the convex feasibility problem, Recent results on Douglas-Rachford methods for combinatorial optimization problems, New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses, A convergent relaxation of the Douglas-Rachford algorithm, Douglas-Rachford splitting and ADMM for pathological convex optimization, Constraint reduction reformulations for projection algorithms with applications to wavelet construction, Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons