首页 | 本学科首页   官方微博 | 高级检索  
     

Hilbert空间中求解分裂可行问题CQ算法的强收敛性
引用本文:赵世莲. Hilbert空间中求解分裂可行问题CQ算法的强收敛性[J]. 应用数学和力学, 2019, 40(1): 108-114. DOI: 10.21656/1000-0887.390012
作者姓名:赵世莲
作者单位:西华师范大学 数学与信息学院, 四川 南充637002
基金项目:国家自然科学基金(11371015)
摘    要:在Hilbert空间中,为了研究分裂可行问题迭代算法的强收敛性,提出了一种新的CQ算法.首先利用CQ算法构造了一个改进的Halpern迭代序列;然后通过把分裂可行问题转化为算子不动点,在较弱的条件下,证明了该序列强收敛到分裂可行问题的一个解.推广了Wang和Xu的有关结果.

关 键 词:分裂可行问题  强收敛  CQ算法  改进的Halpern迭代
收稿时间:2018-01-08

Strong Convergence of CQ Algorithms for Split Feasibility Problems in the Hilbert Spaces
ZHAO Shilian. Strong Convergence of CQ Algorithms for Split Feasibility Problems in the Hilbert Spaces[J]. Applied Mathematics and Mechanics, 2019, 40(1): 108-114. DOI: 10.21656/1000-0887.390012
Authors:ZHAO Shilian
Affiliation:School of Mathematics and Information, China West Normal University, Nanchong, Sichuan 637002, P.R.China
Abstract: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.
Keywords:split feasibility problem  strong convergence  CQ method  modified Halpern iteration
本文献已被 CNKI 维普 等数据库收录!
点击此处可从《应用数学和力学》浏览原始摘要信息
点击此处可从《应用数学和力学》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号