The Rate of Convergence for the Method of Alternating Projections, II

@article{Deutsch1997TheRO,
  title={The Rate of Convergence for the Method of Alternating Projections, II},
  author={Frank Deutsch and Hein Hundal},
  journal={Journal of Mathematical Analysis and Applications},
  year={1997},
  volume={205},
  pages={381-405}
}
  • F. Deutsch, Hein Hundal
  • Published 15 January 1997
  • Mathematics
  • Journal of Mathematical Analysis and Applications
Abstract The purpose of the paper is threefold: (1) To develop a useful error bound for the method of alternating projections which is relatively easy to compute and remember; (2) To exhibit a counterexample to a conjecture of Kayalar and Weinert; (3) To show that (in the case of at least three subspaces) any error bound which only depends on the angles between the various subspaces involved can never be sharp. 
View via Publisher
doi.org
73 Citations
Highly Influential Citations
6
Background Citations
12
Methods Citations
10
Results Citations
5

73 Citations

The rate of convergence in the method of alternating projections
A generalization of the cosine of the Friedrichs angle between two subspaces to a parameter associated to several closed subspaces of a Hilbert space is given. This parameter is used to analyze the…
Characterizing arbitrarily slow convergence in the method of alternating projections
TLDR
A different proof is given that uses the multiplicative form of the spectral theorem, and the theorem holds in any real or complex Hilbert space, not just in a real Hilbert space.
The rate of convergence in themethod of alternating projections
A generalization of the cosine of the Friedrichs angle between two subspaces to several closed subspaces in a Hilbert space is given. This is used to analyze the rate of convergence in the von…
A generalization of the Friedrichs angle and the method of alternating projections
Accelerating the convergence of the method of alternating projections
The powerful von Neumann-Halperin method of alternating projections (MAP) is an algorithm for determining the best approximation to any given point in a Hilbert space from the intersection of a…
The rate of convergence for the cyclic projections algorithm I: Angles between convex sets
Non-optimality of the Greedy Algorithm for Subspace Orderings in the Method of Alternating Projections
The method of alternating projections involves projecting an element of a Hilbert space cyclically onto a collection of closed subspaces. It is known that the resulting sequence always converges in…
On the rate of convergence of the alternating projection method in finite dimensional spaces
Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
This paper combines two ingredients in order to get a rather surprising result on one of the most studied, elegant and powerful tools for solving convex intersection problems, the method of…
The rate of convergence for the cyclic projections algorithm III: Regularity of convex sets
...
...

References

SHOWING 1-10 OF 15 REFERENCES
Error bounds for the method of alternating projections
TLDR
The method of alternating projections produces a sequence which converges to the orthogonal projection onto the intersection of the subspaces, and the sharpest known upper bound for more than two subspaced is obtained.
The Angle Between Subspaces of a Hilbert Space
This is a mainly expository paper concerning two different definitions of the angle between a pair of subspaces of a Hilbert space, certain basic results which hold for these angles, and a few of the…
Rate of Convergence of the Method of Alternating Projections
A proof is given of a rate of convergence theorem for the method of alternating projections. The theorem had been announced earlier in [8] without proof.
On the convergence of von Neumann's alternating projection algorithm for two sets
We give several unifying results, interpretations, and examples regarding the convergence of the von Neumann alternating projection algorithm for two arbitrary closed convex nonempty subsets of a…
On the method of cyclic projections for convex sets in Hilbert space
The method of cyclic projections is a powerful tool for solving convex feasibility problems in Hilbert space. Although in many applications, in particular in the field of image reconstruction…
Theory of Reproducing Kernels.
Abstract : The present paper may be considered as a sequel to our previous paper in the Proceedings of the Cambridge Philosophical Society, Theorie generale de noyaux reproduisants-Premiere partie…
Generalized Image Restoration by the Method of Alternating Orthogonal Projections
We adopt a view that suggests that many problems of image restoration are probably geometric in character and admit the following initial linear formulation: The original f is a vector known a priori…
Approximation Theory, Wavelets and Applications
Preface. A Class of Interpolating Positive Linear Operators: Theoretical and Computational Aspects G. Allasia. Quasi-Interpolation E.W. Cheney. Approximation and Interpolation on Spheres E.W. Cheney.…
On certain inequalities and characteristic value problems for analytic functions and for functions of two variables
the constant r = (1 +6)/(1 -6) being greater than 1. * Presented to the Society, October 31, 1936; received by the editors December 6, 1935, and January 27, 1936. t The same space was investigated in…
Approximation Theory, Spline Functions and Applications
Preface. Approximation by Functions of Nonclassical Form E.W. Cheney. Wavelets- with Emphasis on Spline-Wavelets and Applications to Signal Analysis C.K. Chui. Pade Approximation in One and More…
...
...