On the convergence of von Neumann's alternating projection algorithm for two sets

@article{Bauschke1993OnTC,
  title={On the convergence of von Neumann's alternating projection algorithm for two sets},
  author={Heinz H. Bauschke and J. Borwein},
  journal={Set-Valued Analysis},
  year={1993},
  volume={1},
  pages={185-212}
}
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 Hilbert space. Our research is formulated within the framework of Fejér monotonicity, convex and set-valued analysis. We also discuss the case of finitely many sets. 
Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets
The Method of Alternating Projections
Transversality and Alternating Projections for Nonconvex Sets
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 20 REFERENCES
Dykstra's Alternating Projection Algorithm for Two Sets
Rate of Convergence of the Method of Alternating Projections
Partially finite convex programming, Part II: Explicit lattice models
The method of projections for finding the common point of convex sets
Regularity and Stability for Convex Multivalued Functions
Absolute norms on vector lattices
Convex analysis and variational problems
...
1
2
...