The contraction-proximal point algorithm with square-summable errors

Fixexd point theory and applications

Changan Tian¹  Fenghui Wang² 

[1] Department of Mathematics, Henan Normal University, Xinxiang, P.R. China;Department of Mathematics, Luoyang Normal University, Luoyang, P.R. China

关键词: maximal monotone operator;    proximal point algorithm;    firmly nonexpansive operator;   

DOI  :  10.1186/1687-1812-2013-93

学科分类：数学（综合）

来源: SpringerOpen

【 摘 要 】

In this paper, we study the contraction-proximal point algorithm for approximating a zero of a maximal monotone mapping. The norm convergence of such an algorithm has been established under two new conditions. This extends a recent result obtained by Ceng, Wu and Yao to a more general case. MSC:47J20, 49J40, 65J15, 90C25.

【 授权许可】

CC BY