Characterizing arbitrarily slow convergence in the method of alternating projections
DOI10.1111/j.1475-3995.2008.00682.xzbMath1208.47079arXiv0710.2387MaRDI QIDQ3563612
Frank Deutsch, Heinz H. Bauschke, Hein S. Hundal
Publication date: 31 May 2010
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0710.2387
orthogonal projections; alternating projections; cyclic projections; angle between subspaces; rate of convergence of the method of alternating projections
90C25: Convex programming
49J53: Set-valued and variational analysis
47H09: Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc.
41A65: Abstract approximation theory (approximation in normed linear spaces and other abstract spaces)
47A50: Equations and inequalities involving linear operators, with vector unknowns
47N10: Applications of operator theory in optimization, convex analysis, mathematical programming, economics
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Error bounds for the method of alternating projections
- On the convergence of von Neumann's alternating projection algorithm for two sets
- The rate of convergence for the method of alternating projections. II
- On the von Neumann alternating algorithm in Hilbert space
- On Projection Algorithms for Solving Convex Feasibility Problems
- What Does the Spectral Theorem Say?
- Theory of Reproducing Kernels
- Functional Operators (AM-22), Volume 2