Circumcentering approximate reflections for solving the convex feasibility problem
DOI10.1186/S13663-021-00711-6OpenAlexW3159216602MaRDI QIDQ2138461FDOQ2138461
Alfredo Iusem, Yunier Y. Bello Cruz, Reza Arefidamghani, Luiz-Rafael Santos, Roger Behling, G. H. M. Araújo
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
alternating projectionsconvergence rateerror boundconvex feasibility problemapproximate projectioncircumcentered-reflection method
Numerical mathematical programming methods (65K05) Convex programming (90C25) Decomposition methods (49M27) Acceleration of convergence in numerical analysis (65B99)
Cites Work
- Practical Augmented Lagrangian Methods for Constrained Optimization
- Julia: A Fresh Approach to Numerical Computing
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Variational Analysis
- 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
- Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- Iterative methods for fixed point problems in Hilbert spaces
- Iterative Solution of Nonlinear Equations in Several Variables
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- Decomposition through formalization in a product space
- Title not available (Why is that?)
- Convex analysis and monotone operator theory in Hilbert spaces
- The effect of calmness on the solution set of systems of nonlinear equations
- Proximity Maps for Convex Sets
- Transversality and alternating projections for nonconvex sets
- A Class of Methods for Projection on the Intersection of Several Ellipsoids
- Comparison of several fast algorithms for projection onto an ellipsoid
- An Outer Approximation Algorithm for Solving General Convex Programs
- About intrinsic transversality of pairs of sets
- Best approximation mappings in Hilbert spaces
- Circumcentering the Douglas-Rachford method
- On the linear convergence of circumcentered isometry methods
- Circumcentered methods induced by isometries
- On the linear convergence of the circumcentered-reflection method
- On the circumcentered-reflection method for the convex feasibility problem
- 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
Cited In (10)
- A finitely convergent circumcenter method for the convex feasibility problem
- The block-wise circumcentered-reflection method
- A successive centralized circumcentered-reflection method for the convex feasibility problem
- Circumcentering approximate reflections for solving the convex feasibility problem
- Circumcentering the Douglas-Rachford method
- On the linear convergence of the circumcentered-reflection method
- On the circumcentered-reflection method for the convex feasibility problem
- Bregman circumcenters: monotonicity and forward weak convergence
- Circumcentric directions of cones
- On the centralization of the circumcentered-reflection method
Uses Software
This page was built for publication: Circumcentering approximate reflections for solving the convex feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2138461)
