Copyright © 2012 Min Li. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
This paper presents modified halfspace-relaxation projection (HRP) methods for solving the split feasibility problem (SFP). Incorporating with the techniques of identifying the optimal step length with positive lower bounds, the new methods improve the efficiencies of the HRP method (Qu and Xiu (2008)). Some numerical results are reported to verify the computational preference.