分裂可行性问题的一种改进迭代算法  

A modified iterative algorithm for the split feasibility problem

作　　者：王元恒 吴秀萍 鲁立荣[2] WANG Yuanheng;WU Xiuping;LU Lirong(College of Mathematics and Computer Science,Zhejiang Normal University,Jinhua 321004,China;Xingzhi College,Zhejiang Normal University,Jinhua 321004,China)

机构地区：[1]浙江师范大学数学与计算机科学学院,浙江金华321004 [2]浙江师范大学行知学院,浙江金华321004

出　　处：《浙江师范大学学报（自然科学版）》2020年第2期127-133,共7页Journal of Zhejiang Normal University:Natural Sciences

基　　金：国家自然科学基金资助项目(11671365);浙江省自然科学基金资助项目(LY14A010011)。

摘　　要：在Hilbert空间框架下,利用一种改进后的正则化方法建立了一个对于渐近非扩张映射的迭代算法来求解分裂可行性问题,在一定条件下证明了该算法序列的强收敛性.研究结果改进和推广了近代相关文献的一些结果.A modified regularization method was used to establish a new iterative algorithm for asymptotic nonexpansive mapping to solve the split feasibility problem(SFP)in the framework of Hilbert spaces.The strong convergence of the sequence in the algorithm was proved under some certain conditions.The obtained results improved and extended some relevant results proposed by other authors.

关 键 词：渐近非扩张映射 正则化方法 分裂可行性问题 度量投影 

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