The problem of finding a point in the intersection of a finite family of convex sets in the Euclidean space R″ is considered here. We present a general algorithmic scheme which employs projections onto separating hyperplanes instead of projections onto the convex sets. This scheme includes the method of successive projections of Gubin et al., USSR Comp. Math. and Math. Phys. 7 (1967), 1-24, as a special case. A different realization proposed here is capable of handling the problem when the sets are solid and an interior point of each set is available. This alternative algorithm may, in certain cases, be more attractive than the method of Gubin et al.
ASJC Scopus subject areas
- Applied Mathematics