Let H he a real Hilbert space and let T:H --> 2(H) he a maximal monotone op
erator. In this paper, we first introduce two algorithms of approximating s
olutions of maximal monotone operators. One of them is to generate a strong
ly convergent sequence with limit v epsilon T(-1)0. The other is to discuss
the weak convergence of the proximal point algorithm. Next, using these re
sults, we consider the problem of finding a minimizer of a convex function.
Our methods are motivated by Halpern's iteration and Mann's iteration. (C)
2000 Academic Press.