Abstract
The split feasibility problem (SFP) has many practical applications, which has attracted the attention of many authors. In this paper, we propose a different method to solve the SFP and the fixed-point problem involving quasi-nonexpansive mappings. We relax the conditions of the operator as well as consider the inertial iteration and the adaptive step size. For example, the convergence generated by our new method is better than that of other algorithms, and the convergence rate of our algorithm greatly improves that of previous algorithms.
Funder
The National Natural Science Foundation of China
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献