Abstract
Generalized split feasibility problems governed by generalized hybrid mappings are studied via iterative methods. Several algorithms are introduced to solve them. In particular, weak convergence of these algorithms is proved. As tools, averaged mappings and resolvents of maximal monotone operators are technically maneuvered to facilitate the argument of the proofs to the main results. Applications to Mann’s iteration method for nonexpansive mappings and to equilibrium problems are included.
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.
