Two Iterative Algorithms for Solving the Split Common Fixed Point Problems

被引:1
|
作者
Wu, Dingping [1 ]
Postolache, Mihai [2 ,3 ,4 ,5 ]
机构
[1] Chengdu Univ Informat Technol, Coll Appl Math, Chengdu, Peoples R China
[2] China Med Univ, Ctr Gen Educ, Taichung 40402, Taiwan
[3] Asia Univ, Dept Interior Design, Taichung 41354, Taiwan
[4] Romanian Acad, Gh Mihoc C Iacob Inst Mathemath Stat & Appl Math, Bucharest 050711, Romania
[5] Univ Politehn Bucuresti, Dept Math & Informat, Bucharest 060042, Romania
关键词
Split common fixed point problems; Nonexpansive mappings; Halpern-type algorithm; Mann-type algorithm; VARIATIONAL-INEQUALITIES; CQ ALGORITHM; OPERATORS; PROJECTION; SYSTEMS;
D O I
10.2298/FIL2013375W
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The purpose of this paper is to study the split common fixed point problems (SCFP) involved in nonexpansive mappings in real Hilbert space. We introduce two iterative algorithms for finding a solution of the SCFP involved in nonexpansive mappings, where one is a Mann-type iterative algorithm and another is a Halpern-type iterative algorithm.
引用
收藏
页码:4375 / 4386
页数:12
相关论文
共 50 条