分裂可行问题的两种强收敛CQ算法(英文)

Two Strongly Convergent CQ Algorithms for Split Feasibility Problem

为保证Hilbert空间中求解分裂可行问题迭代算法的强收敛性,本文首先通过引入三个参数序列提出了求解分裂可行问题的改进CQ算法,并在较弱的条件下证明了算法的强收敛性.然后改进算法中的一个算子,即选择另外一个参数序列嵌入到一个算子里,得到了一种新的算法.在参数序列满足一定条件下也证明了算法的强收敛性.本文拓展了现已有的相关研究成果.

In thins paper, in order to ensure the strong convergence of the iterative procedure for solving split feasibility problem in a a modified CQ algorithm by introducing real Hilbert space. We firstly construct three parametric sequences and prove its strong convergence under some weak conditions. Furthermore, we put another parametric sequence in one operator in the presented algorithm to get a new Mgorithm, and also prove its strong convergence under some conditions on the parametric sequence. The results in this paper improve and extend the corresponding results.