Learn More
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 finite number of subspaces. It achieves this by reducing the problem to an iterative scheme which involves only computing best approximations from the individual(More)
Bauschke, Borwein, and Lewis have stated a trichotomy theorem [4, Theorem 5.7.16] that characterizes when the convergence of the method of alternating projections can be arbitrarily slow. However, there are two errors in their proof of this theorem. In this note, we show that although one of the errors is critical, the theorem itself is correct. We give a(More)
  • 1