On the Strong Convergence of Halpern Type Proximal Point Algorithm

Abstract

The main result of this paper is to prove the strong convergence of the sequence generated by the proximal point algorithm of Halpern type to a zero of a maximal monotone operator under the suitable assumptions on the parameters and error. The results extend some of the previous results or give some different conditions for convergence of the sequence. It is also indicated that when the maximal monotone operator is the subdifferential of a convex, proper, and lower semicontinuous function, the results extend all previous results in the literature. We also prove the boundedness of the sequence generated by the algorithm with a weak coercivity condition defined in the paper and without any additional assumptions on the parameters.