ITERATIVE ALGORITHMS FOR THE PROXIMAL SPLIT FEASIBILITY PROBLEM

被引:0
|
作者
Yao, Yonghong [1 ]
Postolache, Mihai [2 ,3 ,4 ]
Qin, Xiaolong [5 ]
Yao, Jen-Chih [6 ]
机构
[1] Tianjin Polytech Univ, Dept Math, Tianjin 300387, Peoples R China
[2] China Med Univ, Taichung 40402, Taiwan
[3] Romanian Acad, Gh Mihoc C Iacob Inst Math Stat & Appl Math, Bucharest 050711, Romania
[4] Univ Politehn Bucuresti, Bucharest 060042, Romania
[5] Univ Elect Sci & Technol China, Inst Fundamental & Frontier Sci, Chengdu 611731, Sichuan, Peoples R China
[6] China Med Univ, Ctr Gen Educ, Taichung 40402, Taiwan
关键词
proximal split feasibility problem; proximal mappings; iterative algorithm; strong convergence; FIXED-POINT PROBLEM; STRONG-CONVERGENCE; HILBERT-SPACES; OPERATORS; PROJECTION;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The proximal split feasibility problem is considered. An iterative algorithm has been constructed for solving the proximal split feasibility problem. Strong convergence result is given.
引用
收藏
页码:37 / 44
页数:8
相关论文
共 50 条