This paper deals with the split feasibility problem that requires to find a point closest to a closed\r\nconvex set in one space such that its image under a linear transformation will be closest to another\r\nclosed convex set in the image space. By combining perturbed strategy with inertial technique, we\r\nconstruct an inertial perturbed projection algorithm for solving the split feasibility problem. Under\r\nsome suitable conditions, we show the asymptotic convergence. The results improve and extend\r\nthe algorithms presented in Byrne 2002 and in Zhao and Yang 2005 and the related convergence\r\ntheorem.
Loading....