On the centralization of the circumcentered-reflection method
From MaRDI portal
Abstract: This paper is devoted to deriving the first circumcenter iteration scheme that does not employ a product space reformulation for finding a point in the intersection of two closed convex sets. We introduce a so-called centralized version of the circumcentered-reflection method (CRM). Developed with the aim of accelerating classical projection algorithms, CRM is successful for tracking a common point of a finite number of affine sets. In the case of general convex sets, CRM was shown to possibly diverge if Pierra's product space reformulation is not used. In this work, we prove that there exists an easily reachable region consisting of what we refer to as centralized points, where pure circumcenter steps possess properties yielding convergence. The resulting algorithm is called centralized CRM (cCRM). In addition to having global convergence, cCRM converges linearly under an error bound condition, and superlinearly if the two target sets are so that their intersection have nonempty interior and their boundaries are locally differentiable manifolds. We also run numerical experiments with successful results.
Recommendations
- On the circumcentered-reflection method for the convex feasibility problem
- The circumcentered-reflection method achieves better rates than alternating projections
- Circumcentering reflection methods for nonconvex feasibility problems
- A successive centralized circumcentered-reflection method for the convex feasibility problem
- The block-wise circumcentered-reflection method
Cites work
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- A Class of Methods for Projection on the Intersection of Several Ellipsoids
- A note on alternating projections for ill-posed semidefinite feasibility problems
- About intrinsic transversality of pairs of sets
- Applications of second-order cone programming
- Benchmarking optimization software with performance profiles.
- Best approximation mappings in Hilbert spaces
- Bregman circumcenters: basic theory
- Bregman circumcenters: monotonicity and forward weak convergence
- Circumcentered methods induced by isometries
- Circumcentering approximate reflections for solving the convex feasibility problem
- Circumcentering reflection methods for nonconvex feasibility problems
- Circumcentering the Douglas-Rachford method
- Circumcentric directions of cones
- Comparison of several fast algorithms for projection onto an ellipsoid
- Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions
- Convex analysis and monotone operator theory in Hilbert spaces
- Decomposition through formalization in a product space
- Finite convergence of locally proper circumcentered methods
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
- Iterative Solution of Nonlinear Equations in Several Variables
- 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
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
- Second-order cone programming
- Solving second-order conic systems with variable precision
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
- The block-wise circumcentered-reflection method
- The circumcentered-reflection method achieves better rates than alternating projections
- The effect of calmness on the solution set of systems of nonlinear equations
- The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
- Transversality and alternating projections for nonconvex sets
Cited in
(3)
This page was built for publication: On the centralization of the circumcentered-reflection method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6126653)
