Hilbert空间中分裂可行性问题的改进Halpern迭代和黏性逼近算法

Modified Halpern Iteration and Viscosity Approximation Methods for Split Feasibility Problems in Hilbert Spaces

在无限维Hilbert空间中,提出了求解分裂可行性问题(SFP)的改进Halpern迭代和黏性逼近算法,证明了当参数满足一定条件时,由给定算法生成的序列强收敛到分裂可行性问题的一个解.这些结论推广了Deepho和Kumam近年来的一些结果.

In infinite-dimensional Hilbert spaces,the modified Halpern iteration and viscosity approximation methods for solving the split feasibility problems（SFPs） were proposed. When the parameters satisfy certain conditions,it is proved that the sequences generated with the proposed algorithms converge strongly to a solution to the split feasibility problem. The main findings improve and extend some recent results by Deepho and Kumam.