New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses

DOI10.1137/141001536zbMath1382.90074arXiv1512.00409OpenAlexW2267827750MaRDI QIDQ2789608

Rafiq Mansour, Yair Censor

Publication date: 2 March 2016

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

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

zbMATH Keywords

strong convergenceconvex feasibility problemfirmly nonexpansiveDouglas-Rachfordstring-averagingquasi-nonexpansivealgorithmic structuresblock-iterativem-set-Douglas-Rachford operatorstrictly Fejér monotone

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items

Gearhart-Koshy acceleration for affine subspaces ⋮ 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 ⋮ Deep neural network structures solving variational inequalities ⋮ Linear convergence rates for extrapolated fixed point algorithms ⋮ The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD

Uses Software

• UNLocBoX

Cites Work

• Unnamed Item
• Compositions and convex combinations of asymptotically regular firmly nonexpansive mappings are also asymptotically regular
• Linear and strong convergence of algorithms involving averaged nonexpansive operators
• Iterative methods for fixed point problems in Hilbert spaces
• Recent results on Douglas-Rachford methods for combinatorial optimization problems
• Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
• Convergence and perturbation resilience of dynamic string-averaging projection methods
• A cyclic Douglas-Rachford iteration scheme
• Global convergence of a non-convex Douglas-Rachford iteration
• A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space
• On the local convergence of the Douglas-Rachford algorithm
• The Douglas–Rachford Algorithm in the Absence of Convexity
• Proximal Splitting Methods in Signal Processing
• DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS
• On Weak Convergence of the Douglas–Rachford Method
• The composition of projections onto closed convex sets in Hilbert space is asymptotically regular
• On the behavior of a block-iterative projection method for solving convex feasibility problems
• On the string averaging method for sparse common fixed‐point problems
• On Diagonally Relaxed Orthogonal Projection Methods
• Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• On Projection Algorithms for Solving Convex Feasibility Problems
• Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
• The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems
• Component-Averaged Row Projections: A Robust, Block-Parallel Scheme for Sparse Linear Systems
• Convex analysis and monotone operator theory in Hilbert spaces