摘要
主要研究了分裂可行问题的一种修正CQ算法的松弛形式,在已有CQ算法的一种修正形式上提出了其松弛算法,并证明了其收敛性,当参数满足一定条件时,该算法的收敛性成立.
This paper mainly studies a modified relaxation form of CQ algorithm of split feasibility problem, proposes its relaxation algorithm based on a modified form of existed CQ algorithm, proves its convergence and indicates that the convergence of this algorithm is established when the parameters satisfy certain conditions.
出处
《重庆工商大学学报（自然科学版）》
2016年第1期16-18,共3页
Journal of Chongqing Technology and Business University:Natural Science Edition
关键词
松弛投影算法
分裂可行问题
收敛
relaxation projection algorithm
split feasibility problem
convergence
