Circumcentering approximate reflections for solving the convex feasibility problem
From MaRDI portal
Publication:2138461
DOI10.1186/s13663-021-00711-6OpenAlexW3159216602MaRDI QIDQ2138461
Reza Arefidamghani, Luiz-Rafael Santos, Roger Behling, G. H. M. Araújo, Alfredo Noel Iusem, Yunier Y. Bello Cruz
Publication date: 12 May 2022
Published in: Fixed Point Theory and Algorithms for Sciences and Engineering (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.00497
error boundconvergence ratealternating projectionsconvex feasibility problemapproximate projectioncircumcentered-reflection method
Numerical mathematical programming methods (65K05) Convex programming (90C25) Decomposition methods (49M27) Acceleration of convergence in numerical analysis (65B99)
Related Items
Circumcentric directions of cones ⋮ Bregman circumcenters: monotonicity and forward weak convergence ⋮ On the centralization of the circumcentered-reflection method ⋮ A successive centralized circumcentered-reflection method for the convex feasibility problem
Uses Software
Cites Work
- Unnamed Item
- Iterative methods for fixed point problems in Hilbert spaces
- Comparison of several fast algorithms for projection onto an ellipsoid
- Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- Transversality and alternating projections for nonconvex sets
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Circumcentering the Douglas-Rachford method
- About intrinsic transversality of pairs of sets
- The effect of calmness on the solution set of systems of nonlinear equations
- 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
- On the linear convergence of the circumcentered-reflection method
- On the circumcentered-reflection method for the convex feasibility problem
- Julia: A Fresh Approach to Numerical Computing
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Proximity Maps for Convex Sets
- Decomposition through formalization in a product space
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- An Outer Approximation Algorithm for Solving General Convex Programs
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- Variational Analysis
- A Class of Methods for Projection on the Intersection of Several Ellipsoids
- On Projection Algorithms for Solving Convex Feasibility Problems
- Iterative Solution of Nonlinear Equations in Several Variables
- On circumcenters of finite sets in Hilbert spaces
- On circumcenter mappings induced by nonexpansive operators
- Practical Augmented Lagrangian Methods for Constrained Optimization
- Convex analysis and monotone operator theory in Hilbert spaces
- Benchmarking optimization software with performance profiles.
