Abstract

In this article, we introduce general inertial Mann algorithms for finding fixed points of nonexpansive mappings in Hilbert spaces, which includes some other algorithms as special cases. We reanalyze the accelerated Mann algorithm, which actually is an inertial type Mann algorithm. We investigate the convergence of the general inertial Mann algorithm, based on which, the strict convergence condition on the accelerated Mann algorithm is eliminated. Also, we apply the general inertial Mann algorithm to show the existence of solutions of the minimization problems by proposing a general inertial type gradient-projection algorithm. Finally, we give preliminary experiments to illustrate the advantage of the accelerated Mann algorithm.

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 call

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.