Abstract
In this paper, the notion of generalized split feasibility problem (GSFP) is studied in p-uniformly convex Banach spaces. Some special cases of the GSFP are highlighted. A self-adaptive step-size iterative algorithm which converges strongly to solution of the GSFP is proved. The implementation of the method is demonstrated with two numerical examples. Our method does not require prior information of operator norms. Our results extend, improve and enrich recently announced related results in the literature.
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.
