Search

Abstract: In this paper, we consider the projection algorithm studied by Iiduka and Takahashi (2008) for finding a solution of the variational inequality problem for an inverse strongly monotone operator in a Banach space. We first remark that, under the assumptions imposed on the operator in their paper, the iterative sequence converges weakly to a zero of the operator, not just a solution of the variational inequality problem. In our proof, slightly modified from the original, we do not assume the uniform smoothness of a space as was the case there. Finally, using Halpern’s type method, we modify this algorithm to obtain the strong convergence to a zero of an inverse strongly monotone operator which is nearest to the initial element of the algorithm in the sense of the Bergman distance associated with the function . [Copyright &y& Elsevier]