On cluster points of alternating projections
From MaRDI portal
Publication:5261776
Abstract: Suppose that and are closed subsets of a Euclidean space such that , and we aim to find a point in this intersection with the help of the sequences and generated by the emph{method of alternating projections}. It is well known that if and are convex, then and converge to some point in . The situation in the nonconvex case is much more delicate. In 1990, Combettes and Trussell presented a dichotomy result that guarantees either convergence to a point in the intersection or a nondegenerate compact continuum as the set of cluster points. In this note, we construct two sets in the Euclidean plane illustrating the continuum case. The sets and can be chosen as countably infinite unions of closed convex sets. In contrast, we also show that such behaviour is impossible for finite unions.
Recommendations
- An alternating projection that does not converge in norm
- Transversality and alternating projections for nonconvex sets
- The method of alternating relaxed projections for two nonconvex sets
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Dykstra's alternating projection algorithm for two sets
Cited in
(5)- On the local convergence of the Douglas-Rachford algorithm
- Randomized projection methods for convex feasibility: conditioning and convergence rates
- scientific article; zbMATH DE number 7053357 (Why is no real title available?)
- Alternating projections with applications to Gerchberg-Saxton error reduction
- There is no variational characterization of the cycles in the method of periodic projections
This page was built for publication: On cluster points of alternating projections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261776)