Abstract
It is well known that the Krasnosel'skii–Mann algorithm and the CQ algorithm for a split feasibility problem are not strongly convergent. In this paper, we present a KM–CQ-like algorithm with strong convergence, which combines the KM algorithm with the CQ algorithm by introducing two parameter sequences for solving the split feasibility problem. Under some parametric controlling conditions, the strong convergence of the algorithm is shown. Finally, we propose a modified KM–CQ-like algorithm and establish its strong convergence theorem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
