On the convergence rate of the over-relaxed proximal point algorithm

This paper is to illustrate that the main result of the paper [R.U. Verma, Generalized over-relaxed proximal algorithm based on A -maximal monotonicity framework and applications to inclusion problems, Mathematical and Computer Modelling 49 (2009) 1587–1594] is incorrect. The convergence rate of the over-relaxed proximal point algorithm should be greater than 1. Moreover, the strong convergence and the unique solution may not be proved accordingly in the paper by Verma.