A Perturbed Projection Algorithm with Inertial Technique for Split Feasibility Problem

Abstract

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

DOI: 10.1155/2012/207323

Cite this paper

@article{Dang2012APP, title={A Perturbed Projection Algorithm with Inertial Technique for Split Feasibility Problem}, author={Yazheng Dang and Yan Gao and Yanli Han}, journal={J. Applied Mathematics}, year={2012}, volume={2012}, pages={207323:1-207323:10} }