A finitely convergent circumcenter method for the convex feasibility problem
type: Item
instance of: scholarly article
title: A finitely convergent circumcenter method for the convex feasibility problem
zbMATH Open document ID: 1545.65238
author: Roger Behling
author: Yunier Y. Bello Cruz
author: Alfredo Iusem
author: Di Liu
author: Luiz-Rafael Santos
published in: SIAM Journal on Optimization
publication date: 2024-07-29T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 7887990
zbMATH Keywords: convex feasibility problem
zbMATH Keywords: finite convergence
zbMATH Keywords: circumcentered-reflection method
zbMATH Keywords: projection methods
MaRDI profile type: MaRDI publication profile
cites work: The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
cites work: The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators
cites work: Circumcentering approximate reflections for solving the convex feasibility problem
cites work: The circumcentered-reflection method achieves better rates than alternating projections
cites work: The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
cites work: Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
cites work: On the convergence of von Neumann's alternating projection algorithm for two sets
cites work: On Projection Algorithms for Solving Convex Feasibility Problems
cites work: On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces
cites work: On circumcenters of finite sets in Hilbert spaces
cites work: Circumcentered methods induced by isometries
cites work: On circumcenter mappings induced by nonexpansive operators
cites work: On the linear convergence of circumcentered isometry methods
cites work: Best approximation mappings in Hilbert spaces
cites work: On the finite convergence of a projected cutter method
cites work: A successive centralized circumcentered-reflection method for the convex feasibility problem
cites work: On the centralization of the circumcentered-reflection method
cites work: Circumcentric directions of cones
cites work: Circumcentering the Douglas-Rachford method
cites work: On the linear convergence of the circumcentered-reflection method
cites work: The block-wise circumcentered-reflection method
cites work: Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
cites work: On the circumcentered-reflection method for the convex feasibility problem
cites work: Julia: A Fresh Approach to Numerical Computing
cites work: Iterative methods for fixed point problems in Hilbert spaces
cites work: Finite convergence of a subgradient projections method with expanding controls
cites work: Q5769827
cites work: Hilbertian convex feasibility problem: Convergence of projection methods
cites work: Strong Convergence of Block-Iterative Outer Approximation Methods for Convex Optimization
cites work: Finding common fixed points of a class of paracontractions
cites work: A finitely convergent ``row-action'' method for the convex feasibility problem
cites work: Circumcentering reflection methods for nonconvex feasibility problems
cites work: Benchmarking optimization software with performance profiles.
cites work: On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
cites work: Generalized alternating projections on manifolds and convex sets
cites work: On convergence rates of linearized proximal algorithms for convex composite optimization with applications
cites work: Q3028739
cites work: Angenäherte Auflösung von Systemen linearer Gleichungen.
cites work: Block-iterative surrogate projection methods for convex feasibility problems
cites work: Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
cites work: Finitely convergent iterative methods with overrelaxations revisited
cites work: Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems
cites work: Set regularities and feasibility problems
cites work: Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions
cites work: Iterative Solution of Nonlinear Equations in Several Variables
cites work: Q5091985
cites work: Bregman circumcenters: monotonicity and forward weak convergence
cites work: Bregman circumcenters: basic theory
cites work: Decomposition through formalization in a product space
cites work: Random algorithms for solving convex inequalities
cites work: Q4235027
cites work: Linear convergence of CQ algorithms and applications in gene regulatory network inference
DOI: 10.1137/23M1595412
description: scientific article; zbMATH DE number 7887990