Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I am looking for reference for following lemma.

Consider a set of hyperplanes $H$ in a $n$-dimensional space. Let $S$ be the set of intersections of all elements of $H$.
Take a point $w$. Repeat as follows: project $w$ on a hyperplane in $H$. If you repeat this, you will get closer to $S$. If you use all hyperplanes infinitely often, you converge to $S$.

In what books I can find such sort of results?

share|cite|improve this question
up vote 2 down vote accepted

I've heard this type of scheme called the "method of sequential projections" and the best place to look for references is in the convex optimization literature.

The earliest result of this kind that I'm aware of is by Cheney and Goldstein, who prove the theorem for two convex sets:

Bregman generalizes it to cyclic projections over multiple convex sets:

A more recent survey of the various generalizations e.g. not requiring cyclic projections can be found in Bauschke and Borwein's

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.