| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 470784 | Computers & Mathematics with Applications | 2010 | 4 Pages |
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 HH-maximal monotone mappings in Hilbert spaces are incorrect.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Zhenyu Huang,