Copyright © 2010 Fenghui Wang and Hong-Kun Xu. 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.
Using the idea of Tikhonov's regularization, we present
properties of the approximating curve for the split feasibility problem
(SFP) and obtain the minimum-norm solution of SFP as the strong limit
of the approximating curve. It is known that in the infinite-dimensional
setting, Byrne's CQ algorithm (Byrne, 2002) has only weak convergence. We introduce a modification of Byrne's CQ algorithm in such a way that strong convergence is guaranteed and the limit is also the minimum-norm solution of SFP.