Finding projections onto the intersection of convex sets in hilbert spaces

Abstract

We present a parallel iterative method to find the shortest distance projection of a given point onto the intersection of a finite number of closed convex sets in a real Hilbert space. In the method use is made of weights and a relaxation coefficient which may vary at each iteration step, and which are determined at each step by geometrical conditions.