Copyright © 2011 Lu Chuan Ceng et al. This is an open access article distributed under the
Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
The purpose of this paper is to introduce and investigate two kinds of iterative algorithms for the problem of finding zeros of maximal monotone operators. Weak and strong convergence theorems are established in a real Hilbert space. As applications, we consider a
problem of finding a minimizer of a convex function.