Let $E$ be a uniformly smooth and uniformly convex real Banach space and $E^*$ be its dual space. Suppose $A : E\rightarrow E^*$ is bounded, strongly monotone and satisfies the range condition such that $A^{-1}(0)\neq \emptyset$. Inspired by Alber \cite{b1}, we introduce Lyapunov functions and use the new geometric properties of Banach spaces to show the strong convergence of an iterative algorithm to the solution of $Ax=0$.

Let K be a nonempty closed convex subset of a Banach space E and T : K → K be a nonexpansive mapping. Using a viscosity approximation method, we study the implicit midpoint rule of a nonexpansive mapping T. We establish a strong convergence theorem for an iterative algorithm in the framework of uniformly smooth Banach spaces and apply our result to obtain the solutions of an accretive mapping and a variational inequality problem. The numerical example which compares the rates of convergence shows that the iterative algorithm is the most efficient. Our result is unique and the method of proof is of independent interest.

No abstract