A successive centralized circumcentered-reflection method for the convex feasibility problem
From MaRDI portal
Publication:6179873
Abstract: In this paper we present the successive centralization of the circumcenter reflection scheme with several control sequences for solving the convex feasibility problem in Euclidean space. Assuming that a standard error bound holds, we prove the linear convergence of the method with the most violated constraint control sequence. Under additional smoothness assumptions, we prove the superlinear convergence. Numerical experiments confirm the efficiency of our method.
Recommendations
- On the circumcentered-reflection method for the convex feasibility problem
- On the centralization of the circumcentered-reflection method
- A finitely convergent circumcenter method for the convex feasibility problem
- On the linear convergence of the circumcentered-reflection method
- Circumcentering reflection methods for nonconvex feasibility problems
Cites work
- scientific article; zbMATH DE number 3532449 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- A cyclic Douglas-Rachford iteration scheme
- A simultaneous projections method for linear inequalities
- Benchmarking optimization software with performance profiles.
- Best approximation mappings in Hilbert spaces
- 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
- Comparison of several fast algorithms for projection onto an ellipsoid
- Complete Closedness of Maximal Monotone Operators
- Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions
- Convergence analysis under consistent error bounds
- Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex functions. Constructions, characterizations and counterexamples
- Decomposition through formalization in a product space
- Finite convergence of locally proper circumcentered methods
- Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
- Iterative Solution of Nonlinear Equations in Several Variables
- Julia: a fresh approach to numerical computing
- Linear convergence of CQ algorithms and applications in gene regulatory network inference
- Mean value theorem for convex functions
- 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 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
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Set regularities and feasibility problems
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- 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 method for inconsistent feasibility problems
- The projection method for solving nonlinear systems of equations under the most violated constraint control
- The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
Cited in
(2)
This page was built for publication: A successive centralized circumcentered-reflection 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 Q6179873)
