A new projection method for finding the closest point in the intersection of convex sets
From MaRDI portal
(Redirected from Publication:683336)
Abstract: In this paper we present a new iterative projection method for finding the closest point in the intersection of convex sets to any arbitrary point in a Hilbert space. This method, termed AAMR for averaged alternating modified reflections, can be viewed as an adequate modification of the Douglas--Rachford method that yields a solution to the best approximation problem. Under a constraint qualification at the point of interest, we show strong convergence of the method. In fact, the so-called strong CHIP fully characterizes the convergence of the AAMR method for every point in the space. We report some promising numerical experiments where we compare the performance of AAMR against other projection methods for finding the closest point in the intersection of pairs of finite dimensional subspaces.
Recommendations
- Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces
- A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space
- scientific article; zbMATH DE number 1174427
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Finding projections onto the intersection of convex sets in hilbert spaces
Cites work
- scientific article; zbMATH DE number 3973706 (Why is no real title available?)
- scientific article; zbMATH DE number 3615396 (Why is no real title available?)
- scientific article; zbMATH DE number 2067645 (Why is no real title available?)
- scientific article; zbMATH DE number 2148414 (Why is no real title available?)
- scientific article; zbMATH DE number 3230744 (Why is no real title available?)
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- A dual approach to constrained interpolation from a convex subset of Hilbert space
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- A simple closure condition for the normal cone intersection formula
- A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space
- Alternating Projections on Manifolds
- Alternating projection methods.
- An Algorithm for Restricted Least Squares Regression
- An alternating projection that does not converge in norm
- Analysis of the convergence rate for the cyclic projection algorithm applied to basic semialgebraic convex sets
- Asymptotic behavior of contractions in Hilbert space
- Best approximation in inner product spaces
- Bounded linear regularity, strong CHIP, and CHIP are distinct properties
- Constrained best approximation in Hilbert space
- Constrained best approximation in Hilbert space. II
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Decomposition through formalization in a product space
- Douglas-Rachford feasibility methods for matrix completion problems
- Dykstra's alternating projection algorithm for two sets
- Fixed points of nonexpanding maps
- Functional Operators (AM-22), Volume 2
- Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
- Global convergence of a non-convex Douglas-Rachford iteration
- Iterative construction of the resolvent of a sum of maximal monotone operators
- Iterative methods for fixed point problems in Hilbert spaces
- Linear convergence of the Douglas-Rachford method for two closed sets
- Local linear convergence for alternating and averaged nonconvex projections
- Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems
- On the Douglas-Rachford algorithm
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- On the convergence of von Neumann's alternating projection algorithm for two sets
- On the local convergence of the Douglas-Rachford algorithm
- On weak convergence of the Douglas-Rachford method
- Projection and proximal point methods: Convergence results and counterexamples.
- Projection methods: Swiss army knives for solving feasibility and best approximation problems with halfspaces
- Projection methods: an annotated bibliography of books and reviews
- Recent results on Douglas-Rachford methods for combinatorial optimization problems
- Set regularities and feasibility problems
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- The Douglas-Rachford algorithm for the case of the sphere and the line
- The Douglas-Rachford algorithm in the absence of convexity
- The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
- The rate of convergence for the method of alternating projections. II
- The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
- Theory of Reproducing Kernels
Cited in
(29)- scientific article; zbMATH DE number 3874995 (Why is no real title available?)
- Douglas–Rachford algorithm for control-constrained minimum-energy control problems
- String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases
- A product space reformulation with reduced dimension for splitting algorithms
- Non-separable multidimensional multiresolution wavelets: a Douglas-Rachford approach
- A Newton Based Radius Reduction Algorithm for Nearest Point Problems in Pos Cones
- Comparing averaged relaxed cutters and projection methods: theory and examples
- Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces
- A splitting method for finding the resolvent of the sum of two maximal monotone operators
- Random projections for linear programming: an improved retrieval phase
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
- Closed-Form Expressions for Projectors onto Polyhedral Sets in Hilbert Spaces
- Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
- Computing the resolvent of the sum of maximally monotone operators with the averaged alternating modified reflections algorithm
- A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization
- Set intersection problems: supporting hyperplanes and quadratic programming
- An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)
- scientific article; zbMATH DE number 3987067 (Why is no real title available?)
- The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning
- The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
- A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space
- A parameterized Douglas-Rachford algorithm
- Deep neural network structures solving variational inequalities
- On the asymptotic behaviour of the Aragón Artacho-Campoy algorithm
- Strengthened splitting methods for computing resolvents
- Finding best approximation pairs for two intersections of closed convex sets
- The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
- Iterative methods for computing the resolvent of the sum of a maximal monotone operator and composite operator with applications
- The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators
This page was built for publication: A new projection method for finding the closest point in the intersection of convex sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q683336)
