On Global Convergence Rate of Two Acceleration Projection Algorithms for Solving the Multiple-Sets Split Feasibility Problem

Qiao-Li Dong, Songnian He, Yanmin Zhao

In this paper, we introduce two fast projection algorithms for solving the multiple-sets split feasibility problem (MSFP). Our algorithms accelerate algorithms proposed in [8] and are proved to have a global convergence rate $O(1=n^2)$. Preliminary numerical experiments show that these algorithms are practical and promising.