Some convergence strategies for the alternating generalized projection method
Summary: In this paper we extend the application of the alternating projection algorithm to solve the problem of finding a point in the intersection of \(n\) sets (\(n\geq2\)), which are not all of them convex sets. Here we term such method as alternating generalized projection (AGP) method. In particular, we are interested in addressing the problem of avoiding the so-called trap points, which may prevent an algorithm to obtain a feasible solution in two or more sets not all convex. Some strategies that allow us to reach the feasible solution are established and conjectured. Finally, we present simple numerical results that illustrate the efficiency of the iterative methods considered.
- Alternating projection methods.
- Cyclic projection methods on a class of nonconvex sets
- Decomposition through formalization in a product space
- Designing structured tight frames via an alternating projection method
- scientific article; zbMATH DE number 3177945 (Why is no real title available?)
- scientific article; zbMATH DE number 1145160 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- Method of successive projections for finding a common point of sets in metric spaces
- On Projection Algorithms for Solving Convex Feasibility Problems
- Proximity Maps for Convex Sets
- The Cinderella.2 Manual
This page was built for publication: Some convergence strategies for the alternating generalized projection method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1653932)