On local convergence of the method of alternating projections

Abstract

The method of alternating projections is a classical tool to solve feasibility problems. Here we prove local convergence of alternating projections between subanalytic sets $A,B$ under a mild regularity hypothesis on one of the sets. We show that the speed of convergence is O$(k^{-\rho })$ for some $\rho \in (0,\infty )$.

Cited by in corpus (1)

• On the local convergence of the Douglas-Rachford algorithm