Summary: 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.
For the entire collection see [Zbl 1402.47001].