Solving a Split Feasibility Problem by the Strong Convergence of Two Projection Algorithms in Hilbert Spaces
Keyword(s):
The goal of this manuscript is to establish strong convergence theorems for inertial shrinking projection and CQ algorithms to solve a split convex feasibility problem in real Hilbert spaces. Finally, numerical examples were obtained to discuss the performance and effectiveness of our algorithms and compare the proposed algorithms with the previous shrinking projection, hybrid projection, and inertial forward-backward methods.
2014 ◽
Vol 2014
(1)
◽
pp. 11
◽
2021 ◽
Vol 0
(0)
◽
2017 ◽
Vol 10
(04)
◽
pp. 1470-1477
◽