咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >Two inertial-type algorithms f... 收藏

Two inertial-type algorithms for solving the split feasibility problem

作     者:Yao, Zhongsheng Vong, Seakweng 

作者机构:Univ Macau Dept Math Ave Univ Macau Peoples R China 

出 版 物:《OPTIMIZATION》 (最优化)

年 卷 期:2023年第72卷第10期

页      面:2661-2678页

核心收录:

学科分类:12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070105[理学-运筹学与控制论] 0701[理学-数学] 

基  金:Science and Technology Development Fund, Macau SAR [0005/2019/A] University of Macau [MYRG2018-00047-FST] O Fundo para o Desenvolvimento das Ciencias e da Tecnologia de Macau 

主  题:Split feasibility problem inertial factor relaxed splitting method CQ algorithm 

摘      要:In this paper, we study two inertial-type algorithms with a relaxed splitting method for solving the split feasibility problem in Hilbert spaces. Weak convergence is established without assuming conditions such as Sigma(infinity)(k=1) theta(k)parallel to x(k) - x(k-1)parallel to(2) infinity and Sigma(infinity)(k=1) parallel to x(k) - x(k-1)parallel to(2) infinity, where theta(k) is the inertial factor. Compared with existing results where inertial factors are usually less than one, the inertial factor in the first algorithm can be taken as nonnegative numbers greater than one. The efficiency and advantage of our algorithms are illustrated by numerical experiments.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分