Abstract: A new and simpler algorithm for solving convex feasibility problems named selective projection method is proposed. This method has the advantage of small computational effort since it only computes the projection operator once in each iteration. Meanwhile, the strong convergence of the algorithm is proved.

Key words: convex feasibility problem, selective projection method, level set, strong convergence