A Modified CQ Algorithm for Solving the Multiple-Sets Split Feasibility Problem and the Fixed Point Problem for Nonexpansive Mappings

被引:0
|
作者
Kesornprom, Suparat [1 ]
Pholasa, Nattawut [1 ]
Cholamjiak, Prasit [1 ]
机构
[1] Univ Phayao, Sch Sci, Phayao 56000, Thailand
来源
THAI JOURNAL OF MATHEMATICS | 2019年 / 17卷 / 02期
关键词
multiple-sets split feasibility problem; relaxed CQ algorithm; Hilbert space; weak and strong convergence; fixed point problem; STRONG-CONVERGENCE; PROJECTION;
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this work, we propose a new relaxed CQ algorithm for solving the multiple-sets split feasibility problem (MSFP) and the fixed point problem for nonexpansive mappings. We obtain weak and strong convergence theorems of the proposed algorithm in Hilbert spaces. Finally, we provide numerical experiments to show the efficiency of our algorithm.
引用
收藏
页码:475 / 493
页数:19
相关论文
共 50 条