The Convex Feasibility Problem, i.e. the problem of finding a point in the intersection of a family of closed convex sets in Banach spaces. This problem is of broad interdisciplinary interest in many areas of applied mathematics and engineering. In mathematical programming it us usually stated as the problem of finding a solution of nonlinear inequalities. It also arises in set theoretic design, estimation problems, transportation, antenna array design, communication, topography, digital filter design and image recovery problems.