The optimal error bound for the method of simultaneous projections
From MaRDI portal
Publication:2406901
DOI10.1016/j.jat.2017.08.005zbMath1381.41013arXiv1704.00308OpenAlexW2615470213MaRDI QIDQ2406901
Publication date: 4 October 2017
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.00308
Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Rate of convergence, degree of approximation (41A25) Simultaneous approximation (41A28) Best constants in approximation theory (41A44)
Related Items
Polynomial estimates for the method of cyclic projections in Hilbert spaces ⋮ Comparing the methods of alternating and simultaneous projections for two subspaces ⋮ Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces ⋮ Methods of reflections: relations with Schwarz methods and classical stationary iterations, scalability and preconditioning. ⋮ On the method of reflections ⋮ Error bounds for the method of simultaneous projections with infinitely many subspaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ritt operators and convergence in the method of alternating projections
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
- Convergence of non-periodic infinite products of orthogonal projections and nonexpansive operators in Hilbert space
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Slow convergence of sequences of linear operators. II: Arbitrarily slow convergence
- The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
- Error bounds for the method of alternating projections
- Generalization of the Trotter-Lie formula
- On the convergence of von Neumann's alternating projection algorithm for two sets
- On rings of operators. Reduction theory
- The rate of convergence in the method of alternating projections
- Arbitrarily Slow Convergence of Sequences of Linear Operators: A Survey
- Characterizing arbitrarily slow convergence in the method of alternating projections
- A limit theorem for projections
- Decomposition through formalization in a product space
- On Projection Algorithms for Solving Convex Feasibility Problems
- Theory of Reproducing Kernels
- Best approximation in inner product spaces