A successive centralized circumcentered-reflection method for the convex feasibility problem
From MaRDI portal
Publication:6179873
DOI10.1007/s10589-023-00516-warXiv2212.06911OpenAlexW4385767679MaRDI QIDQ6179873
Luiz-Rafael Santos, Roger Behling, Alfredo Noel Iusem, Yunier Y. Bello Cruz, Di Liu
Publication date: 18 January 2024
Published in: Computational Optimization and Applications (Search for Journal in Brave)
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
- Comparison of several fast algorithms for projection onto an ellipsoid
- A simultaneous projections method for linear inequalities
- The projection method for solving nonlinear systems of equations under the most violated constraint control
- Mean value theorem for convex functions
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Circumcentering the Douglas-Rachford method
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- On the linear convergence of circumcentered isometry methods
- Circumcentered methods induced by isometries
- The circumcentered-reflection method achieves better rates than alternating projections
- Best approximation mappings in Hilbert spaces
- Circumcentering approximate reflections for solving the convex feasibility problem
- Circumcentering reflection methods for nonconvex feasibility problems
- The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
- The block-wise circumcentered-reflection method
- 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
- Set regularities and feasibility problems
- On the linear convergence of the circumcentered-reflection method
- On the circumcentered-reflection method for the convex feasibility problem
- Bregman circumcenters: basic theory
- Bregman circumcenters: monotonicity and forward weak convergence
- On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications
- Julia: A Fresh Approach to Numerical Computing
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Complete Closedness of Maximal Monotone Operators
- Decomposition through formalization in a product space
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- Iterative Solution of Nonlinear Equations in Several Variables
- Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
- On circumcenters of finite sets in Hilbert spaces
- On circumcenter mappings induced by nonexpansive operators
- The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems
- Linear convergence of CQ algorithms and applications in gene regulatory network inference
- Convex analysis and monotone operator theory in Hilbert spaces
- Benchmarking optimization software with performance profiles.
- Circumcentric directions of cones
- 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
