A cyclic Douglas-Rachford iteration scheme

From MaRDI portal
Publication:2250057

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




Related Items

On the order of the operators in the Douglas-Rachford algorithmConvergence of a randomized Douglas-Rachford method for linear systemGlobal behavior of the Douglas-Rachford method for a nonconvex feasibility problemLinear convergence of the generalized Douglas-Rachford algorithm for feasibility problemsA modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert spaceITERATIVE PROJECTION AND REFLECTION METHODS: THEORY AND PRACTICEA Parallel Douglas–Rachford Algorithm for Minimizing ROF-like Functionals on Images with Values in Symmetric Hadamard ManifoldsCircumcentering the Douglas-Rachford methodReflection Methods for Inverse Problems with Applications to Protein Conformation DeterminationA direct proof of convergence of Davis-Yin splitting algorithm allowing larger stepsizesDOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMSA real-time iterative projection scheme for solving the common fixed point problem and its applicationsGearhart-Koshy acceleration for affine subspacesOn the circumcentered-reflection method for the convex feasibility problemOn the linear convergence of the circumcentered-reflection methodA comparative note on the relaxation algorithms for the linear semi-infinite feasibility problemLinear and strong convergence of algorithms involving averaged nonexpansive operatorsThe Douglas-Rachford algorithm for convex and nonconvex feasibility problemsUnion averaged operators with applications to proximal algorithms for MIN-convex functionsConvergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point ProblemsThe block-wise circumcentered-reflection methodUnrestricted Douglas-Rachford algorithms for solving convex feasibility problems in Hilbert spaceRandomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and EfficiencyRegularity of sets under a reformulation in a product space with reduced dimensionA successive centralized circumcentered-reflection method for the convex feasibility problemThe cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operatorsRecent results on Douglas-Rachford methods for combinatorial optimization problemsThe rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angleGeneral splitting methods with linearization for the split feasibility problemNew Douglas--Rachford Algorithmic Structures and Their Convergence AnalysesAn acceleration scheme for Dykstra's algorithmConstraint reduction reformulations for projection algorithms with applications to wavelet constructionLinear Convergence of Projection AlgorithmsNorm convergence of realistic projection and reflection methodsSURVEY: SIXTY YEARS OF DOUGLAS–RACHFORDAPPLICATION OF PROJECTION ALGORITHMS TO DIFFERENTIAL EQUATIONS: BOUNDARY VALUE PROBLEMSIteration process for fixed point problems and zeros of maximal monotone operatorsProjection methods for high numerical aperture phase retrievalOptimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons



Cites Work