Circumcentering approximate reflections for solving the convex feasibility problem
From MaRDI portal
Publication:2138461
Cites work
- A Class of Methods for Projection on the Intersection of Several Ellipsoids
- About intrinsic transversality of pairs of sets
- An Outer Approximation Algorithm for Solving General Convex Programs
- Benchmarking optimization software with performance profiles.
- Best approximation mappings in Hilbert spaces
- Circumcentered methods induced by isometries
- Circumcentering the Douglas-Rachford method
- Comparison of several fast algorithms for projection onto an ellipsoid
- Convex analysis and monotone operator theory in Hilbert spaces
- Decomposition through formalization in a product space
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- Generalized relaxations of nonexpansive operators and convex feasibility problems
- Iterative Solution of Nonlinear Equations in Several Variables
- Iterative methods for fixed point problems in Hilbert spaces
- Julia: a fresh approach to numerical computing
- Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- On Projection Algorithms for Solving Convex Feasibility Problems
- On circumcenter mappings induced by nonexpansive operators
- On circumcenters of finite sets in Hilbert spaces
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- 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
- Practical augmented Lagrangian methods for constrained optimization
- Proximity Maps for Convex Sets
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- The circumcentered-reflection method achieves better rates than alternating projections
- The effect of calmness on the solution set of systems of nonlinear equations
- Transversality and alternating projections for nonconvex sets
- Variational Analysis
Cited in
(10)- On the centralization of the circumcentered-reflection method
- 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 the Douglas-Rachford method
- On the linear convergence of the circumcentered-reflection method
- Circumcentering approximate reflections for solving the convex feasibility problem
- On the circumcentered-reflection method for the convex feasibility problem
- Bregman circumcenters: monotonicity and forward weak convergence
- Circumcentric directions of cones
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)
