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

  • Authors:

  • Zhenyu Huang

  • Affiliations:

  • -

  • Venue:
  • Computers & Mathematics with Applications
  • Year:
  • 2010

Quantified Score

Hi-index 0.09

Visualization

Abstract

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 monotonicity design and applications, Computers and Mathematics with Applications 55 (2008) 2673-2679] concerning the strong convergence of the over-relaxed proximal point algorithm for H-maximal monotone mappings in Hilbert spaces are incorrect.