Dykstra′s Alternating Projection Algorithm for Two Sets Original Research Article

We analyze Dykstra′s algorithm for two arbitrary closed convex sets in a Hilbert space. Our technique also applies to von Neumann′s algorithm. Various convergence results follow. An example allows one to compare qualitative and quantitative behaviour of the two algorithms. We discuss the case of finitely many sets.