Hilbert空间中求解分裂可行问题CQ算法的强收敛性  

Strong Convergence of CQ Algorithms for Split Feasibility Problems in the Hilbert Spaces

作　　者：赵世莲[1] ZHAO Shilian(School of Mathematics and Information,China West Normal University,Nanchong,Sichuan 537002,P.R.China)

机构地区：[1]西华师范大学数学与信息学院,四川南充637002

出　　处：《应用数学和力学》2019年第1期108-114,共7页Applied Mathematics and Mechanics

基　　金：国家自然科学基金(11371015)~~

摘　　要：在Hilbert空间中,为了研究分裂可行问题迭代算法的强收敛性,提出了一种新的CQ算法.首先利用CQ算法构造了一个改进的Halpern迭代序列;然后通过把分裂可行问题转化为算子不动点,在较弱的条件下,证明了该序列强收敛到分裂可行问题的一个解.推广了Wang和Xu的有关结果.To study the strong convergence of split feasibility problems,a new CQ algorithm was proposed in the Hilbert spaces. Firstly,the modified Halpern iterative sequence was obtained with the CQ method. Furthermore,the split feasibility problem was transformed into the fixed point for operators,and it was proved that the sequence converges strongly to a solution of the split feasibility problem under some weak conditions. The findings generalize the corresponding results of Wang and Xu.

关 键 词：分裂可行问题 强收敛 CQ算法 改进的Halpern迭代 

分 类 号：O177.91[理学—数学]