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

DOI10.1016/j.jat.2006.02.005zbMath1109.41016OpenAlexW2100885264MaRDI 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

algorithmsconvex sets

Mathematics Subject Classification ID

Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Best approximation, Chebyshev systems (41A50)

Related Items

Local linear convergence for alternating and averaged nonconvex projections, Stochastic block projection algorithms with extrapolation for convex feasibility problems, Single-projection procedure for linear optimization, The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators, Restricted normal cones and the method of alternating projections: applications, Convergence of non-periodic infinite products of orthogonal projections and nonexpansive operators in Hilbert space, Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour, Random algorithms for convex minimization problems, Structure-Preserving Function Approximation via Convex Optimization, The method of alternating relaxed projections for two nonconvex sets, Convergence properties of dynamic string-averaging projection methods in the presence of perturbations, Characterizing arbitrarily slow convergence in the method of alternating projections, Stochastic First-Order Methods with Random Constraint Projection, The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets, Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities, Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm, A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin, Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates, Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item