Iterative algorithms for nonexpansive mappings on Hadamard manifolds (Q993621)

The literature on the iterative approximation of fixed points is very rich, see for example the reviewer's monograph [\textit{V. Berinde}, ``Iterative approximation of fixed points'' (2nd revised and enlarged ed.)\ (Lecture Notes in Mathematics 1912; Berlin: Springer) (2007; Zbl 1165.47047)]. Amongst the fixed point iterative algorithms, Halpern's iteration and Mann's iteration play a central role. In the case of a real normed linear space \(X\), if \(K\) is a convex subset and \(T:K\rightarrow K\) is a self-map, then the Mann iteration associated to \(T\) is defined by the iterative sequence \(\{x_n\}_{n\geq 0}\), given by \[ x_{n+1}=\alpha_n x_{n}+(1-\alpha_n) T x_n,\quad n\geq 0, \] where \(x_0\in K\) is the initial approximation and \(\{\alpha_n\}_{n\geq 0}\) is a real sequence in \((0,1)\), while Halpern's iteration is defined by \[ x_{n+1}=\alpha_n u+(1-\alpha_n) T x_n,\quad n\geq 0, \] with \(u\in K\) an ``anchor'', as it has recently been named. The paper under review proposes two fixed point algorithms of Halpern's and Mann's type, respectively, in order to approximate the fixed points of nonexpansive mappings \(T\) on Hadamard manifolds. Convergence theorems are obtained and some numerical tests are also reported. The results given in the paper appear to be very important.