Abstract
This paper analysis the dimension and the shape of conver- gence regions of three algorithms used to solve the convex feasibility prob- lem in bidimensional space: the Parallel Projection Method (PPM), the classical Extrapolated Method of Parallel Projections (EMOPP) and a mod- ied version of EMOPP.

This publication has 1 reference indexed in Scilit: