多集分裂等式问题的逐次松弛投影算法  

Successive relaxed projection algorithm for multiple-sets split equality problem

作　　者：周雪玲 李梅霞[2] 车海涛[2] ZHOU Xueling;LI Meixia;CHE Haitao(School of Mathematical Science,Yangzhou University,Yangzhou 225002,Jiangsu,China;School of Mathematics and Information Science,Weifang University,Weifang 261061,Shandong,China)

机构地区：[1]扬州大学数学科学学院,江苏扬州225002 [2]潍坊学院数学与信息科学学院,山东潍坊261061

出　　处：《运筹学学报》2021年第2期93-103,共11页Operations Research Transactions

基　　金：国家自然科学基金(Nos.11401438,11571120);山东省自然科学基金(Nos.ZR2020MA027,ZR2019MA022)。

摘　　要：多集分裂等式问题是分裂可行性问题的拓展问题,在图像重建、语言处理、地震探测等实际问题中具有广泛的应用。为了解决这个问题,提出了逐次松弛投影算法,设计了变化的步长,使其充分利用当前迭代点的信息且不需要算子范数的计算,证明了算法的弱收敛性。数值算例验证了算法在迭代次数与运行时间等方面的优越性。The multiple-sets split equality problem is an extended split feasibility problem,which has a wide application in image reconstruction,language processing,and seismic exploration.In order to solve this problem,we propose a successive relaxed projection algorithm with a variable stepsize which can fully use the information of the current iteration point and does not need the calculation of the operator norm.Furthermore the weak convergence of the algorithm is proved.The numerical examples show the superiority of the algorithm in the number of iterations and the running time.

关 键 词：多集分裂等式问题 逐次松弛投影算法 收敛性 

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