PROJECTION ALGORITHMS FOR SOLVING CONVEX FEASIBILITY PROBLEMS

Due to their extraordinary utility and broad applicability in many are as of classical mathematics and modern physical sciences (most notably , computerized tomography), algorithms for solving convex feasibility problems continue to receive great attention. To unify, generalize, an d review some of these algorithms, a very broad and flexible framework is investigated. Several crucial new concepts which allow a systemati c discussion of questions on behaviour in general Hilbert spaces and o n the quality of convergence are brought out. Numerous examples are gi ven.