The method of alternating relaxed projections for two nonconvex sets
From MaRDI portal
(Redirected from Publication:484479)
Abstract: The Method of Alternating Projections (MAP), a classical algorithm for solving feasibility prob- lems, has recently been intensely studied for nonconvex sets. However, intrinsically available are only local convergence results: convergence occurs if the starting point is not too far away from solutions to avoid getting trapped in certain regions. Instead of taking full projection steps, it can be advantageous to underrelax, i.e., to move only part way towards the constraint set, in order to enlarge the regions of convergence. In this paper, we thus systematically study the Method of Alternating Relaxed Projections (MARP) for two (possibly nonconvex) sets. Complementing our recent work on MAP, we es- tablish local linear convergence results for the MARP. Several examples illustrate our analysis.
Recommendations
- Restricted normal cones and the method of alternating projections: applications
- Transversality and alternating projections for nonconvex sets
- Local linear convergence for inexact alternating projections on nonconvex sets
- Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem
- Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 3853749 (Why is no real title available?)
- scientific article; zbMATH DE number 3671159 (Why is no real title available?)
- scientific article; zbMATH DE number 47597 (Why is no real title available?)
- scientific article; zbMATH DE number 3595777 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- Asymptotic behavior of compositions of under-relaxed nonexpansive operators
- Best approximation in inner product spaces
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
- Fréchet-Legendre functions and reflexive Banach spaces
- Functional Operators (AM-22), Volume 2
- Iterative methods for fixed point problems in Hilbert spaces
- Local linear convergence for alternating and averaged nonconvex projections
- Method of successive projections for finding a common point of sets in metric spaces
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the convergence of von Neumann's alternating projection algorithm for two sets
- On the factorization of matrices
- Restricted normal cones and the method of alternating projections: applications
- Restricted normal cones and the method of alternating projections: theory
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
- The method of projections for finding the common point of convex sets
- The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
- The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators
- The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
Cited in
(25)- A counterexample to De Pierro's conjecture on the convergence of under-relaxed cyclic projections
- On the existence of minimizers of proximity functions for split feasibility problems
- Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem
- Comparing averaged relaxed cutters and projection methods: theory and examples
- An alternating iterative method and its application in statistical inference
- Regularity of sets under a reformulation in a product space with reduced dimension
- Some convergence strategies for the alternating generalized projection method
- Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
- Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning
- On cluster points of alternating projections
- Global convergence and acceleration of projection methods for feasibility problems involving union convex sets
- Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
- Local linear convergence for inexact alternating projections on nonconvex sets
- Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems
- Linear convergence of the Douglas-Rachford method for two closed sets
- Generalized relaxations of nonexpansive operators and convex feasibility problems
- scientific article; zbMATH DE number 3987067 (Why is no real title available?)
- Convergence of weighted averages of relaxed projections
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
- Generalized alternating projections on manifolds and convex sets
- Linear convergence of projection algorithms
- Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms
- Transversality and alternating projections for nonconvex sets
- Restricted normal cones and the method of alternating projections: applications
- Restricted normal cones and the method of alternating projections: theory
This page was built for publication: The method of alternating relaxed projections for two nonconvex sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q484479)
