An implementation of Halpern-type proximal algorithms for nonsmooth problems

被引：0
|
作者：
Sun, Lei [1 ]
Chen, Heng [2 ]
Fan, Xiaodong [3 ]
机构：
[1] Bohai Univ, Coll Informat Sci & Technol, Jinzhou 121013, Peoples R China
[2] Chinese Peoples Liberat Army, Uint 78046, Chengdu 610031, Peoples R China
[3] Bohai Univ, Dept Math, Jinzhou 121013, Peoples R China
来源：
PROCEEDINGS OF 2016 IEEE ADVANCED INFORMATION MANAGEMENT, COMMUNICATES, ELECTRONIC AND AUTOMATION CONTROL CONFERENCE (IMCEC 2016) | 2016年
基金：
中国国家自然科学基金;
关键词：
proximal point algorithm; maximal monotone operator; nonsmooth problem; Halpern type algorithm; Subdifferential; APPROXIMATION;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper develops two implementations of Halpern-type proximal algorithms (HPAI and HPA2) solving nonsmooth problems. We prove their convergence to the solutions of the problems under the new conditions. Applying this idea to the Basis Pursuit model in image/signal processing, a new Halpern-type proximal algorithm (HPA) for the model is obtained. Experiments show that the Halpern-type proximal algorithm has better descent property than the usual proximal algorithm (PA) for the Basis Pursuit model.
引用
收藏
页码：969 / 973
页数：5
相关论文
共 50 条
12345