Approximating Curve and Strong Convergence of the CQ Algorithm for the Split Feasibility Problem

被引:103
作者
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
关键词
ITERATIVE ALGORITHMS; CONVEX-SETS;
D O I
10.1155/2010/102085
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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.
引用
收藏
页数:13
相关论文
共 17 条
[1]  
Alber YI., 2006, NONLINEAR ILL POSED
[2]  
Aubin J.P., 1993, GRADUATE TEXTS MATH, V140
[4]   A unified treatment of some iterative algorithms in signal processing and image reconstruction [J].
Byrne, C .
INVERSE PROBLEMS, 2004, 20 (01) :103-120
[5]  
Censor Y., 1994, Numerical Algorithms, V8, P221, DOI DOI 10.1007/BF02142692
[6]   ITERATION METHODS FOR CONVEXLY CONSTRAINED ILL-POSED PROBLEMS IN HILBERT-SPACE [J].
EICKE, B .
NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION, 1992, 13 (5-6) :413-429
[7]   EXAMPLE CONCERNING FIXED-POINTS [J].
GENEL, A ;
LINDENSTRAUSS, J .
ISRAEL JOURNAL OF MATHEMATICS, 1975, 22 (01) :81-92
[8]  
Goebel K., 1990, Topics in Metric Fixed Point Theory, Cambridge Studies in Advanced Mathematics, V28
[9]  
GULER O, 1991, SIAM J CONTROL OPTIM, V29, P403, DOI 10.1137/0329022
[10]   MEAN VALUE METHODS IN ITERATION [J].
MANN, WR .
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1953, 4 (03) :506-510