A remark on the strong convergence of the over-relaxed proximal point algorithm

This paper illustrates that the conditions and the main proof of two main theorems of Verma [R.U. Verma, The over-relaxed proximal point algorithm based on H-maximal mono- tonicity design and applications, Computers and Mathematics with Applications 55 (2008) 2673 2679] concerning the strong convergence of the over-relaxed proximal point algo- rithm for H-maximal monotone mappings in Hilbert spaces are incorrect.