The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets

DOI10.1016/j.jat.2006.02.005zbMath1109.41016MaRDI QIDQ855483

Frank Deutsch, Hein S. Hundal

Publication date: 7 December 2006

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jat.2006.02.005

zbMATH Keywords

algorithms; convex sets

Mathematics Subject Classification ID

41A60: Asymptotic approximations, asymptotic expansions (steepest descent, etc.)

41A50: Best approximation, Chebyshev systems

Related Items

Local linear convergence for alternating and averaged nonconvex projections, 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, A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin, Characterizing arbitrarily slow convergence in the method of alternating projections

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• The rate of convergence for the method of alternating projections. II
• Principal component analysis.
• An alternating projection that does not converge in norm
• Convex Sets and Nearest Points
• An Algorithm for Restricted Least Squares Regression
• Practical and mathematical aspects of the problem of reconstructing objects from radiographs
• The method of alternating projections and the method of subspace corrections in Hilbert space
• On Projection Algorithms for Solving Convex Feasibility Problems
• Theory of Reproducing Kernels
• Best approximation in inner product spaces