On cluster points of alternating projections

zbMATH Open1324.65095arXiv1307.2712MaRDI QIDQ5261776FDOQ5261776

Heinz H. Bauschke, Dominikus Noll

Publication date: 7 July 2015

Abstract: Suppose that $A$ and $B$ are closed subsets of a Euclidean space such that $AcapBeqvarnothing$, and we aim to find a point in this intersection with the help of the sequences $(a_n{)}_{n}n$ and $(b_n{)}_{n}n$ generated by the emph{method of alternating projections}. It is well known that if $A$ and $B$ are convex, then $(a_n{)}_{n}n$ and $(b_n{)}_{n}n$ converge to some point in $AcapB$. 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 $A$ and $B$ can be chosen as countably infinite unions of closed convex sets. In contrast, we also show that such behaviour is impossible for finite unions.

Full work available at URL: https://arxiv.org/abs/1307.2712

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

zbMATH Keywords

convergenceprojectioncontinuumconvex setmethod of alternating projectionscluster pointnon-convex set

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Set-valued operators (47H04) Numerical methods of relaxation type (49M20)

Cited In (5)

• Title not available (Why is that?)
• On local convergence of the method of alternating projections
• On the local convergence of the Douglas-Rachford algorithm
• Alternating projections with applications to Gerchberg-Saxton error reduction
• Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates

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)