Iterative algorithms based on the hybrid steepest descent method for the split feasibility problem

In this paper, we introduce two iterative algorithms based on the hybrid steepest descent method for solving the split feasibility problem. We establish results on the strong convergence of the sequences generated by the proposed algorithms to a solution of the split feasibility problem, which is a solution of a certain variational inequality. In particular, the minimum norm solution of the split feasibility problem is obtained.