Abstract
In this paper, we introduce a new kind of a relaxed CQ algorithm to find the solution of the multiple-set split feasibility problem and the equilibrium problem in a Hilbert space. We prove weak and strong convergence theorems to the proposed algorithm under some mild conditions. Finally, we provide some numerical experiments to show the efficiency and the implementation of our method.
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 callMore From: Rendiconti del Circolo Matematico di Palermo Series 2
Disclaimer: 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.
