文献类型：期刊文献

英文题名：Approximating Curve and Strong Convergence of the CQ Algorithm for the Split Feasibility Problem

作者：Wang, Fenghui[2,3];Xu, Hong-Kun[1]

机构：[1]Natl Sun Yat Sen Univ, Dept Appl Math, Kaohsiung 80424, Taiwan;[2]E China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R China;[3]Luoyang Normal Univ, Dept Math, Luoyang 471022, Peoples R China

年份：2010

外文期刊名：JOURNAL OF INEQUALITIES AND APPLICATIONS

收录：;WOS:【SCI-EXPANDED(收录号:WOS:000276278900001)】；

基金：H. K. Xu was supported in part by NSC 97-2628-M-110-003-MY3, and by DGES MTM2006-13997-C02-01.

语种：英文

摘要：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.