“…It can be described as follows: D 1 , D 2 , · · · , D N , where N denotes some positive integer, are finitely many closed convex nonempty subsets of a Hilbert space with D := ∩ N i=1 D i = ∅. Convex feasibility problem is to find a solution in D. Closely related subjects of the problem are variational inequality problems, zero point problems, fixed point problems and equilibrium problem; see [1,3,4,7,8,9,10,11,12,13,14,15,17,18,19,20,23,24,26,27,28,29,30] and the references therein.…”