Polynomial estimates for the method of cyclic projections in Hilbert spaces

DOI10.1007/S11075-023-01533-WMaRDI QIDQ6076936zbMATH OpenOpenAlexFDO

Authors Simeon Reich, Rafał Zalas

Publication date 17 October 2023

Published in Numerical Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

product spacerates of asymptotic regularityrates of convergence

Mathematics Subject Classification ID

Rate of convergence, degree of approximation (41A25) Simultaneous approximation (41A28) Best constants in approximation theory (41A44) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Numerical solutions to equations with nonlinear operators (65J15)

Abstract: We study the method of cyclic projections when applied to closed and linear subspaces $M_i$, $i=1,ldots,m$, of a real Hilbert space $mathcalH$. We show that the average distance to individual sets enjoys a polynomial behaviour $o(k^{-1/2})$ along the trajectory of the generated iterates. Surprisingly, when the starting points are chosen from the subspace $su{m}_{i=1}^m{M}_i^{p}erp$, our result yields a polynomial rate of convergence $mathcalO(k^{-1/2})$ for the method of cyclic projections itself. Moreover, if $su{m}_{i=1}^m{M}_i^{p}erp$ is not closed, then both of the aforementioned rates are best possible in the sense that the corresponding polynomial $k^{1/2}$ cannot be replaced by $k^{1/2+varepsilon}$ for any $varepsilon>0$.

Recommendations

• The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
• The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
• The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators
• The rate of convergence in the method of alternating projections
• scientific article; zbMATH DE number 2033473

Cites work

• A functional calculus based on the numerical range: applications
• Alternating projections, remotest projections, and greedy approximation
• Arbitrarily slow convergence of sequences of linear operators
• Arbitrarily slow convergence of sequences of linear operators: a survey
• Best approximation in inner product spaces
• Characterizing arbitrarily slow convergence in the method of alternating projections
• Complexifications of real spaces: general aspects
• Convergence properties of dynamic string-averaging projection methods in the presence of perturbations
• Decomposition through formalization in a product space
• Error bounds for the method of alternating projections
• Error bounds for the method of simultaneous projections with infinitely many subspaces
• Functional analysis, Sobolev spaces and partial differential equations
• scientific article; zbMATH DE number 1009689 (Why is no real title available?)
• scientific article; zbMATH DE number 2111135 (Why is no real title available?)
• scientific article; zbMATH DE number 3230744 (Why is no real title available?)
• Iterates of a product of conditional expectation operators
• Iterative methods for fixed point problems in Hilbert spaces
• On Projection Algorithms for Solving Convex Feasibility Problems
• On rings of operators. Reduction theory
• On the von Neumann alternating algorithm in Hilbert space
• Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
• Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces
• Quantified asymptotic behaviour of Banach space operators and applications to iterative projection methods
• Real analysis. A comprehensive course in analysis, part 1
• Ritt operators and convergence in the method of alternating projections
• Slow convergence of sequences of linear operators. II: Arbitrarily slow convergence
• The optimal error bound for the method of simultaneous projections
• The rate of convergence in the method of alternating projections
• The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
• Theory of Reproducing Kernels

Cited in

(4)

• Comparing the methods of alternating and simultaneous projections for two subspaces
• A convergence rate estimate for remotest projections on three subspaces
• Consecutive projections and greedy approximation in Hilbert space
• Tight Convergence Bounds for the Classical Kaczmarz Method

This page was built for publication: Polynomial estimates for the method of cyclic projections in Hilbert spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6076936)