A cyclic Douglas-Rachford iteration scheme

DOI10.1007/s10957-013-0381-xzbMath1305.90407arXiv1303.1859OpenAlexW3102957613MaRDI QIDQ2250057

Matthew K. Tam, Jonathan M. Borwein

Publication date: 4 July 2014

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

numerical experimentconvex feasibility problemDouglas-Rachford method

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48)

Related Items

On the order of the operators in the Douglas-Rachford algorithm ⋮ Convergence of a randomized Douglas-Rachford method for linear system ⋮ Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem ⋮ Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems ⋮ A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space ⋮ ITERATIVE PROJECTION AND REFLECTION METHODS: THEORY AND PRACTICE ⋮ 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 direct proof of convergence of Davis-Yin splitting algorithm allowing larger stepsizes ⋮ DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS ⋮ A real-time iterative projection scheme for solving the common fixed point problem and its applications ⋮ 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 ⋮ A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem ⋮ Linear and strong convergence of algorithms involving averaged nonexpansive operators ⋮ 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 ⋮ Unrestricted Douglas-Rachford algorithms for solving convex feasibility problems in Hilbert space ⋮ Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency ⋮ Regularity of sets under a reformulation in a product space with reduced dimension ⋮ A successive centralized circumcentered-reflection method for the convex feasibility problem ⋮ The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators ⋮ Recent results on Douglas-Rachford methods for combinatorial optimization problems ⋮ The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle ⋮ General splitting methods with linearization for the split feasibility problem ⋮ New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses ⋮ An acceleration scheme for Dykstra's algorithm ⋮ Constraint reduction reformulations for projection algorithms with applications to wavelet construction ⋮ Linear Convergence of Projection Algorithms ⋮ Norm convergence of realistic projection and reflection methods ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD ⋮ APPLICATION OF PROJECTION ALGORITHMS TO DIFFERENTIAL EQUATIONS: BOUNDARY VALUE PROBLEMS ⋮ Iteration process for fixed point problems and zeros of maximal monotone operators ⋮ Projection methods for high numerical aperture phase retrieval ⋮ Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compositions and convex combinations of asymptotically regular firmly nonexpansive mappings are also asymptotically regular
• Restricted normal cones and the method of alternating projections: theory
• Convergence of non-periodic infinite products of orthogonal projections and nonexpansive operators in Hilbert space
• Recent results on Douglas-Rachford methods for combinatorial optimization problems
• Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
• A Lyusternik-Graves theorem for the proximal point method
• Local linear convergence for alternating and averaged nonconvex projections
• Transversality and alternating projections for nonconvex sets
• On the convergence of von Neumann's alternating projection algorithm for two sets
• Dykstra's alternating projection algorithm for two sets
• The Douglas–Rachford Algorithm in the Absence of Convexity
• Krasnoselski-Mann Iterations in Normed Spaces
• Maximum entropy and feasibility methods for convex and nonconvex inverse problems
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Proximity Maps for Convex Sets
• An Algorithm for Restricted Least Squares Regression
• Iterated Products of Projections in Hilbert Space
• The Asymptotic Behavior of Firmly Nonexpansive Mappings
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• On Projection Algorithms for Solving Convex Feasibility Problems
• Searching with iterated maps
• Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• Functional Operators (AM-22), Volume 2
• Convex analysis and monotone operator theory in Hilbert spaces