An inertial triple-projection algorithm for solving the split feasibility problem

This paper proposes a new inertial triple-projection algorithm for solving the split feasibility problem. The process of projections is divided into three parts. Each part adopts different variable stepsize to obtain its projection point, which from existing extragradient methods. Flexible rules are employed selecting stepsizes and technique used improving convergence. Convergence results proven. Numerical experiments show that proposed method converges more quickly than general CQ algorithm.