On the circumcentered-reflection method for the convex feasibility problem

DOI10.1007/s11075-020-00941-6zbMath1460.49023arXiv2001.01773OpenAlexW3103438079MaRDI QIDQ2661677

Roger Behling, Luiz-Rafael Santos, Yunier Y. Bello Cruz

Publication date: 7 April 2021

Published in: Numerical Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

circumcenterconvex feasibility problemmethod of alternating projectionsDouglas-Rachford methodaccelerating convergencereflection method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Decomposition methods (49M27) Acceleration of convergence in numerical analysis (65B99)

Related Items (12)

Circumcentering approximate reflections for solving the convex feasibility problem ⋮ Circumcentering reflection methods for nonconvex feasibility problems ⋮ 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 ⋮ 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 ⋮ Unnamed Item ⋮ The circumcentered-reflection method achieves better rates than alternating projections

Cites Work

• Unnamed Item
• 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
• The Douglas-Rachford algorithm for the case of the sphere and the line
• Applications of second-order cone programming
• Second-order cone programming
• Circumcentering the Douglas-Rachford method
• The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
• The block-wise circumcentered-reflection method
• 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
• Solving second-order conic systems with variable precision
• On the Douglas-Rachford algorithm
• On the linear convergence of the circumcentered-reflection method
• Global convergence of a non-convex Douglas-Rachford iteration
• Linear convergence of the Douglas–Rachford method for two closed sets
• The Douglas--Rachford Algorithm for Two (Not Necessarily Intersecting) Affine Subspaces
• Proximal point algorithm, Douglas-Rachford algorithm and alternating projections: a case study
• The Douglas–Rachford Algorithm in the Absence of Convexity
• On Weak Convergence of the Douglas–Rachford Method
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Decomposition through formalization in a product space
• On Projection Algorithms for Solving Convex Feasibility Problems
• On circumcenters of finite sets in Hilbert spaces
• The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems
• Convex analysis and monotone operator theory in Hilbert spaces
• Benchmarking optimization software with performance profiles.

This page was built for publication: On the circumcentered-reflection method for the convex feasibility problem