A finitely convergent circumcenter method for the convex feasibility problem

Cites Work

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

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)