Many applied problems such as image reconstructions and signal processing can be formulated as the split feasibility problem (SFP). Some algorithms have been introduced in the literature for solving the (SFP). In this paper, we will continue to consider the convergence analysis of the regularized methods for the (SFP). Two regularized methods are presented in the present paper. Under some different control conditions, we prove that the suggested algorithms strongly converge to the minimum norm solution of the (SFP).
"Regularized Methods for the Split Feasibility Problem." Abstr. Appl. Anal. 2012 (SI12) 1 - 13, 2012. https://doi.org/10.1155/2012/140679