Iterative projection method for solving convex feasibility problem

Iterative projection method for solving convex feasibility problem

Convex feasibility problem(CFP) has many applications in various elds of science and technology, particularly in image reconstruction from projection. The purpose of this paper is to study convex feasibility problems in a Hilbert space and iterative method which is proposed for solving CFPs. Each iteration is a convex combination of projections onto the given convex sets where the weights of the combination may vary from step to step. Also we discuss about projection methods and show how they can solve CFPs.