A new approximate proximal point algorithm for maximal monotone operator

被引:0
|
作者
何炳生
杨振华
廖立志
机构
[1] , Kowloon Tong, Kowloon, Hong Kong, China
[2] , Nanjing 210093, China
[3] Department of Mathematics, Nanjing University,Department of Mathematics, Nanjing University,Department of Mathematics, Hong Kong Baptist University Nanjing 210093, China
基金
中国国家自然科学基金;
关键词
proximal point algorithms; monotone operators; approximate methods;
D O I
暂无
中图分类号
O177 [泛函分析];
学科分类号
070104 ;
摘要
The problem concerned in this paper is the set-valued equation 0 ∈T(z) where T is a maximal monotone operator. For given xk and βk > 0, some existing approximate proximal point algorithms take xk+1= xk such thatwhere {ηk} is a non-negative summable sequence. Instead of xk+1 = xk , the new iterate of the proposing method is given bywhere Ω is the domain of T and PΩ(·) denotes the projection on Ω. The convergence is proved under a significantly relaxed restriction supk>0 ηk<1.
引用
收藏
页码:200 / 206
页数:7
相关论文
共 50 条