Unrestricted Douglas-Rachford algorithms for solving convex feasibility problems in Hilbert space

DOI10.1080/10556788.2022.2157003arXiv2204.00275OpenAlexW4319068405MaRDI QIDQ6113524

Kay Barshad, Simeon Reich, Aviv Gibali

Publication date: 9 August 2023

Published in: Optimization Methods and Software (Search for Journal in Brave)

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

zbMATH Keywords

iterative methodconvex feasibility problemcommon fixed point problemstrongly nonexpansive operatorDouglas-Rachford algorithmunrestricted product

Mathematics Subject Classification ID

Operator theory (47-XX) Numerical analysis (65-XX)

Cites Work

• Unnamed Item
• Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
• Iterative methods for fixed point problems in Hilbert spaces
• A von Neumann alternating method for finding common solutions to variational inequalities
• Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems
• A cyclic Douglas-Rachford iteration scheme
• On the Douglas-Rachford algorithm
• New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Unrestricted iterations of nonexpansive mappings in Hilbert space
• Inducing strong convergence into the asymptotic behaviour of proximal splitting algorithms in Hilbert spaces
• On Projection Algorithms for Solving Convex Feasibility Problems
• Reflected three-operator splitting method for monotone inclusion problem
• The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: Unrestricted Douglas-Rachford algorithms for solving convex feasibility problems in Hilbert space