alternating projection

In mathematics, projections onto convex sets (POCS), sometimes known as the alternating projection method, is a method to find a point in the intersection of two closed convex sets. It is a very simple algorithm and has been rediscovered many times. The simplest case, when the sets are affine spaces, was analyzed by John von Neumann. The case when the sets are affine spaces is special, since the iterates not only converge to a point in the intersection (assuming the intersection is non-empty) but to the orthogonal projection of the point onto the intersection. For general closed convex sets, the limit point need not be the projection. Classical work on the case of two closed convex sets shows that the rate of convergence of the iterates is linear.
There are now extensions that consider cases when there are more than two sets, or when the sets are not convex, or that give faster convergence rates. Analysis of POCS and related methods attempt to show that the algorithm converges (and if so, find the rate of convergence), and whether it converges to the projection of the original point. These questions are largely known for simple cases, but a topic of active research for the extensions. There are also variants of the algorithm, such as Dykstra's projection algorithm. See the references in the further reading section for an overview of the variants, extensions and applications of the POCS method; a good historical background can be found in section III of.

Algorithm

The POCS algorithm solves the following problem:

: $\text \; x \in \mathbb^n \quad\text\; x \in C \cap D$

where ''C'' and ''D'' are closed convex sets.

To use the POCS algorithm, one must know how to project onto the sets ''C'' and ''D'' separately.
The algorithm starts with an arbitrary value for $x_0$ and then generates the sequence

: $x_ = \mathcal_C \left( \mathcal_D ( x_k ) \right).$

The simplicity of the algorithm explains some of its popularity. If the intersection of ''C'' and ''D'' is non-empty, then the sequence generated by the algorithm will converge to some point in this intersection.

Unlike Dykstra's projection algorithm, the solution need not be a projection onto the intersection ''C'' and ''D''.

Related algorithms

The method of averaged projections is quite similar. For the case of two closed convex sets ''C'' and ''D'', it proceeds by

: $x_ = \frac( \mathcal_C(x_k) + \mathcal_D(x_k) )$

It has long been known to converge globally. Furthermore, the method is easy to generalize to more than two sets; some convergence results for this case are in.Local convergence for alternating and averaged nonconvex projections. A Lewis, R Luke, J Malick, 2007
arXiv
/ref>

The ''averaged'' projections method can be reformulated as ''alternating'' projections method using a standard trick. Consider the set

: $E = \$

which is defined in the product space $\mathbb^n \times \mathbb^n$.
Then define another set, also in the product space:

: $F = \.$

Thus finding $C \cap D$ is equivalent to finding $E \cap F$.

To find a point in $E \cap F$, use the alternating projection method. The projection of a vector $(x,y)$ onto the set ''F'' is given by $(x+y,x+y)/2$. Hence

: $(x_,y_) = \mathcal_( \mathcal_( (x_,y_) ) ) = \mathcal_( (\mathcal_x_,\mathcal_y_) ) = \frac( \mathcal_C(x_k) + \mathcal_D(y_k) , (\mathcal_C(x_k) + \mathcal_D(y_k) ).$

Since $x_ = y_$ and assuming $x_0 = y_0$, then $x_j=y_j$ for all $j \ge 0$, and hence we can simplify the iteration to $x_ = \frac( \mathcal_C(x_k) + \mathcal_D(x_k) )$.

References

{{reflist

Further reading

* Book from 2011
Alternating Projection Methods
by René Escalante and Marcos Raydan (2011), published by SIAM.

Convex geometry