An Inertial Accelerated Algorithm for Solving Split Feasibility Problem with Multiple Output Sets

The paper proposes an inertial accelerated algorithm for solving split feasibility problem with multiple output sets. To improve the feasibility, the algorithm involves computing of projections onto relaxed sets (half spaces) instead of computing onto the closed convex sets, and it does not require calculating matrix inverse. To accelerate the convergence, the algorithm adopts self-adaptive rules and incorporates inertial technique. The strong convergence is shown under some suitable conditions. In addition, some newly derived results are presented for solving the split feasibility problem and split feasibility problem with multiple output sets. Finally, numerical experiments illustrate that the algorithm converges more quickly than some existing algorithms. Our results extend and improve some methods in the literature.