A finitely convergent circumcenter method for the convex feasibility problem

Recommendations

On finitely convergent iterative methods for the convex feasibility problem
A successive centralized circumcentered-reflection method for the convex feasibility problem
Publication:3028739
On the circumcentered-reflection method for the convex feasibility problem
A finitely convergent ``row-action method for the convex feasibility problem

Cites work

scientific article; zbMATH DE number 4016617 (Why is no real title available?)
scientific article; zbMATH DE number 1266748 (Why is no real title available?)
scientific article; zbMATH DE number 3029984 (Why is no real title available?)
A finitely convergent ``row-action method for the convex feasibility problem
A successive centralized circumcentered-reflection method for the convex feasibility problem
Angenäherte Auflösung von Systemen linearer Gleichungen.
Benchmarking optimization software with performance profiles.
Best approximation mappings in Hilbert spaces
Block-iterative surrogate projection methods for convex feasibility problems
Bregman circumcenters: basic theory
Bregman circumcenters: monotonicity and forward weak convergence
Circumcentered methods induced by isometries
Circumcentering approximate reflections for solving the convex feasibility problem
Circumcentering reflection methods for nonconvex feasibility problems
Circumcentering the Douglas-Rachford method
Circumcentric directions of cones
Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions
Decomposition through formalization in a product space
Finding common fixed points of a class of paracontractions
Finite convergence of a subgradient projections method with expanding controls
Finite convergence of locally proper circumcentered methods
Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems
Finitely convergent iterative methods with overrelaxations revisited
Generalized alternating projections on manifolds and convex sets
Hilbertian convex feasibility problem: Convergence of projection methods
Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
Iterative Solution of Nonlinear Equations in Several Variables
Iterative methods for fixed point problems in Hilbert spaces
Julia: a fresh approach to numerical computing
Linear convergence of CQ algorithms and applications in gene regulatory network inference
On Projection Algorithms for Solving Convex Feasibility Problems
On circumcenter mappings induced by nonexpansive operators
On circumcenters of finite sets in Hilbert spaces
On convergence rates of linearized proximal algorithms for convex composite optimization with applications
On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
On the centralization of the circumcentered-reflection method
On the circumcentered-reflection method for the convex feasibility problem
On the convergence of von Neumann's alternating projection algorithm for two sets
On the finite convergence of a projected cutter method
On the finite convergence of the Douglas-Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces
On the linear convergence of circumcentered isometry methods
On the linear convergence of the circumcentered-reflection method
Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
Random algorithms for solving convex inequalities
Set regularities and feasibility problems
Strong Convergence of Block-Iterative Outer Approximation Methods for Convex Optimization
Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
The block-wise circumcentered-reflection method
The circumcentered-reflection method achieves better rates than alternating projections
The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators
The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle

Cited in

(1)

A successive centralized circumcentered-reflection method for the convex feasibility problem

This page was built for publication: A finitely convergent circumcenter method for the convex feasibility problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579996)