The Split Feasibility Problem in Hilbert Space

被引：0
|
作者：
Wu Dingping [1 ]
Duan Qibin [1 ]
Wang Erli [1 ]
Zhao Hang [1 ]
机构：
[1] Chengdu Univ Informat Technol, Dept Math, Chengdu 610225, Peoples R China
来源：
PROCEEDINGS OF THE 2012 INTERNATIONAL CONFERENCE ON COMMUNICATION, ELECTRONICS AND AUTOMATION ENGINEERING | 2013年 / 181卷
关键词：
Split feasibility problem; CQ algorithm; Ishikawa iterative algorithm;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The purpose of this paper is to introduce and study Ishikawa iterative algorithms for solving the SFP in the setting of infinite-dimensional Hilbert spaces. The main results presented in this paper improve and extend some recent results done by Xu [Iterative methods for the split feasibility problem in infinite-dimensional Hilbert space, Inverse Problems 26 (2010) 105018]. At the end we prove that the accumulation of errors in Ishikawa iterative CQ algorithm is bounded in certain range.
引用
收藏
页码：1149 / 1154
页数：6
相关论文
共 50 条
12345