A STRONGLY CONVERGENT PARALLEL PROJECTION ALGORITHM FOR CONVEX FEASIBILITY PROBLEM y

In this paper, we present a strongly convergent parallel pro- jection algorithm by introducing some parameter sequences for convex fea- sibility problem. To prove the strong convergence in a simple way, we transmit the parallel algorithm in the original space to an alternating one in a newly constructed product space. Thus, the strong convergence of the parallel projection algorithm is derived with the help of the alternating one under some parametric controlling conditions.