CORC  > 兰州理工大学  > 兰州理工大学  > 理学院
A Family of Multi-Parameterized Proximal Point Algorithms
Bai, Jianchao3; Guo, Ke2; Chang, Xiaokai1
刊名IEEE Access
2019
卷号7页码:164021-164028
关键词Convex optimization Numerical methods Parameter estimation Variational techniques Well testing complexity Convex minimization Global conver-gence Linear constraints Minimization problems Numerical experiments Proximal point algorithm Variational inequalities
ISSN号2169-3536
DOI10.1109/ACCESS.2019.2952155
英文摘要In this paper, a multi-parameterized proximal point algorithm combining with a relaxation step is developed for solving convex minimization problem subject to linear constraints. We show its global convergence and sublinear convergence rate from the prospective of variational inequality. Preliminary numerical experiments on testing a sparse minimization problem from signal processing indicate that the proposed algorithm performs better than some well-established methods. © 2013 IEEE.
WOS研究方向Computer Science ; Engineering ; Telecommunications
语种英语
出版者Institute of Electrical and Electronics Engineers Inc., United States
WOS记录号WOS:000509475800005
内容类型期刊论文
源URL[http://ir.lut.edu.cn/handle/2XXMBERH/114720]  
专题理学院
作者单位1.School of Science, Lanzhou University of Technology, Lanzhou; 730050, China
2.School of Mathematics and Information, China West Normal University, Nanchong; 637002, China;
3.Department of Applied Mathematics, Northwestern Polytechnical University, Xi'an; 710129, China;
推荐引用方式
GB/T 7714
Bai, Jianchao,Guo, Ke,Chang, Xiaokai. A Family of Multi-Parameterized Proximal Point Algorithms[J]. IEEE Access,2019,7:164021-164028.
APA Bai, Jianchao,Guo, Ke,&Chang, Xiaokai.(2019).A Family of Multi-Parameterized Proximal Point Algorithms.IEEE Access,7,164021-164028.
MLA Bai, Jianchao,et al."A Family of Multi-Parameterized Proximal Point Algorithms".IEEE Access 7(2019):164021-164028.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace