A successive centralized circumcentered-reflection method for the convex feasibility problem
From MaRDI portal
Publication:6179873
DOI10.1007/S10589-023-00516-WarXiv2212.06911OpenAlexW4385767679MaRDI QIDQ6179873FDOQ6179873
Authors: Roger Behling, Yunier Y. Bello Cruz, Alfredo Iusem, Di Liu, Luiz-Rafael Santos 
Publication date: 18 January 2024
Published in: Computational Optimization and Applications (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2212.06911
Numerical mathematical programming methods (65K05) Convex programming (90C25) Decomposition methods (49M27) Acceleration of convergence in numerical analysis (65B99)
Cites Work
- Julia: A Fresh Approach to Numerical Computing
- Mean value theorem for convex functions
- 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.
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Title not available (Why is that?)
- Convex functions. Constructions, characterizations and counterexamples
- Iterative Solution of Nonlinear Equations in Several Variables
- 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
- The cyclic Douglas-Rachford method for inconsistent feasibility problems
- Decomposition through formalization in a product space
- Convex analysis and monotone operator theory in Hilbert spaces
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
- A simultaneous projections method for linear inequalities
- Comparison of several fast algorithms for projection onto an ellipsoid
- Title not available (Why is that?)
- Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
- 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
- Complete Closedness of Maximal Monotone Operators
- The projection method for solving nonlinear systems of equations under the most violated constraint control
- 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
- 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
- Title not available (Why is that?)
- 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
- Convergence analysis under consistent error bounds
Cited In (1)
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)
