Abstract
In this paper, a simple proof is presented for the Convergence of the algorithms for the class of relaxed $(u, v)$-cocoercive mappings and $alpha$-inverse strongly monotone mappings. Based on $alpha$-expansive maps, for example, a simple proof of the convergence of the recent iterative algorithms by relaxed $(u, v)$-cocoercive mappings due to Kumam-Jaiboon is provided. Also a simple proof for the convergence of the iterative algorithms by inverse-strongly monotone mappings due to Iiduka-Takahashi in a special case is provided. These results are an improvement as well as a refinement of previously known results.
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: International Journal of Nonlinear Analysis and Applications
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.
