共 50 条
On the convergence rate of the over-relaxed proximal point algorithm
被引:2
|作者:
Huang, Zhenyu
[1
]
Noor, Muhammad Aslam
[2
]
机构:
[1] Nanjing Univ, Dept Math, Nanjing 210093, Jiangsu, Peoples R China
[2] COMSATS Inst Informat Technol, Dept Math, Islamabad, Pakistan
基金:
中国国家自然科学基金;
关键词:
Variational inclusions;
A-maximal monotone mappings;
Proximal point algorithm;
Convergence rate;
D O I:
10.1016/j.aml.2012.02.003
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
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. (C) 2012 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1740 / 1743
页数:4
相关论文