A New CQ Algorithm for Solving Split Feasibility Problems in Hilbert Spaces

被引:32
作者
Nguyen The Vinh [1 ]
Cholamjiak, Prasit [2 ]
Suantai, Suthep [3 ]
机构
[1] Ton Duc Thang Univ, Fac Math & Stat, Appl Anal Res Grp, Ho Chi Minh City, Vietnam
[2] Univ Phayao, Sch Sci, Phayao 56000, Thailand
[3] Chiang Mai Univ, Dept Math, Ctr Excellence Math & Appl Math, Chiang Mai 50200, Thailand
关键词
Split feasibility problem; Variational inequality; Gradient projection method; Weak convergence; Strong convergence; minimum-norm solution; ITERATIVE ALGORITHMS; SETS;
D O I
10.1007/s40840-018-0614-0
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this paper, we propose a CQ-type algorithm for solving the split feasibility problem (SFP) in real Hilbert spaces. The algorithm is designed such that the step-sizes are directly computed at each iteration. We will show that the sequence generated by the proposed algorithm converges in norm to the minimum-norm solution of the SFP under appropriate conditions. In addition, we give some numerical examples to verify the implementation of our method. Our result improves and complements many known related results in the literature.
引用
收藏
页码:2517 / 2534
页数:18
相关论文
共 25 条