The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators
From MaRDI portal
Publication:5379466
DOI10.1080/10556788.2018.1504049zbMath1461.65117arXiv1801.00480OpenAlexW2964036799MaRDI QIDQ5379466
Francisco J. Aragón Artacho, Aviv Gibali, Yair Censor
Publication date: 12 June 2019
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.00480
Related Items (6)
A direct proof of convergence of Davis-Yin splitting algorithm allowing larger stepsizes ⋮ The Douglas-Rachford algorithm for convex and nonconvex feasibility problems ⋮ Unrestricted Douglas-Rachford algorithms for solving convex feasibility problems in Hilbert space ⋮ Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD ⋮ Iteration process for fixed point problems and zeros of maximal monotone operators
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
- Iterative methods for fixed point problems in Hilbert spaces
- Recent results on Douglas-Rachford methods for combinatorial optimization problems
- A new projection method for finding the closest point in the intersection of convex sets
- The Douglas-Rachford algorithm for the case of the sphere and the line
- Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
- Best practices for comparing optimization algorithms
- A cyclic Douglas-Rachford iteration scheme
- On the Douglas-Rachford algorithm
- New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses
- Opial-Type Theorems and the Common Fixed Point Problem
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Projection methods: an annotated bibliography of books and reviews
- Decomposition through formalization in a product space
- Unrestricted iterations of nonexpansive mappings in Hilbert space
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- On Projection Algorithms for Solving Convex Feasibility Problems
- Iterative projection onto convex sets using multiple Bregman distances
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Convex analysis and monotone operator theory in Hilbert spaces
- Benchmarking optimization software with performance profiles.
This page was built for publication: The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators
