On the linear convergence of the circumcentered-reflection method
From MaRDI portal
Publication:2417091
DOI10.1016/j.orl.2017.11.018OpenAlexW2768888796MaRDI QIDQ2417091
Roger Behling, Luiz-Rafael Santos, José Yunier Bello Cruz
Publication date: 11 June 2019
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.08651
Related Items
Circumcentering approximate reflections for solving the convex feasibility problem ⋮ Circumcentering reflection methods for nonconvex feasibility problems ⋮ On the circumcentered-reflection method for the convex feasibility problem ⋮ Bregman circumcenters: basic theory ⋮ Circumcentric directions of cones ⋮ Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions ⋮ Bregman circumcenters: monotonicity and forward weak convergence ⋮ The block-wise circumcentered-reflection method ⋮ On the centralization of the circumcentered-reflection method ⋮ A successive centralized circumcentered-reflection method for the convex feasibility problem ⋮ Centering projection methods for wavelet feasibility problems ⋮ On the linear convergence of circumcentered isometry methods ⋮ Circumcentered methods induced by isometries ⋮ Unnamed Item ⋮ The circumcentered-reflection method achieves better rates than alternating projections ⋮ A note on the finite convergence of alternating projections ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD ⋮ Best approximation mappings in Hilbert spaces
Cites Work
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
- Linear and strong convergence of algorithms involving averaged nonexpansive operators
- Recent results on Douglas-Rachford methods for combinatorial optimization problems
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Circumcentering the Douglas-Rachford method
- Affine nonexpansive operators, Attouch-Théra duality and the Douglas-Rachford algorithm
- The Douglas-Rachford algorithm in the affine-convex case
- A cyclic Douglas-Rachford iteration scheme
- The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
- On the Douglas-Rachford algorithm
- The Douglas--Rachford Algorithm for Two (Not Necessarily Intersecting) Affine Subspaces
- DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS
- On Weak Convergence of the Douglas–Rachford Method
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit
- Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
- On Projection Algorithms for Solving Convex Feasibility Problems
- The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems
- Convex analysis and monotone operator theory in Hilbert spaces
- Best approximation in inner product spaces
