分裂可行问题自适应步长惯性球松弛CQ算法  

Self-adaptive stepsize inertial ball-relaxed CQ algorithm for split feasibility problem

作　　者：张雅轩[1] 张亚龙 ZHANG Yaxuan;ZHANG Yalong(College of Science,CAUC,Tianjin 300300,China)

机构地区：[1]中国民航大学理学院,天津300300

出　　处：《中国民航大学学报》2020年第6期61-64,共4页Journal of Civil Aviation University of China

基　　金：国家自然科学基金青年科学基金项目(61503385);中央高校基本科研业务费专项(3122018L004)。

摘　　要：针对分裂可行性问题,在自适应步长球松弛CQ算法基础上引入惯性项,加快算法的收敛速度;同时,利用Halpern迭代格式调整算法,并证明算法在无限维Hilbert空间中强收敛。Aiming at the split feasibility problem,an inertial term is added into the ball-relaxed CQ algorithm with self-adaptive stepsize in order to accelerate the convergence rate.Meanwhile,the algorithm is adjusted according to Halpern iteration structure.Finally,strong convergence of the current algorithm is proved in infinite-dimensional Hilbert space.

关 键 词：分裂可行性问题 CQ算法 球松弛 惯性 自适应步长 

分 类 号：O177.91[理学—数学] O241.7[理学—基础数学]