| 带1-范数约束的分裂可行问题的投影算法 |
| |
| 引用本文： | 畅含笑,屈彪.带1-范数约束的分裂可行问题的投影算法[J].数学杂志,2017,37(6):1234-1244. |
| |
| 作者姓名： | 畅含笑 屈彪 |
| |
| 作者单位： | 曲阜师范大学管理学院, 山东 日照 276826,曲阜师范大学管理学院, 山东 日照 276826 |
| |
| 基金项目： | 国家自然科学基金（11271226）；山东省优秀中青年科学家科研奖励基金（BS2012SF027）. |
| |
| 摘 要： | 本文主要研究带1-范数约束的分裂可行问题的求解算法.用一种交替投影算法,求得了问题的解,提出松弛交替投影算法,改进了直接往闭凸集上投影这一不足,并证明了该算法的收敛性.
|
| 关 键 词： | 分裂可行问题 1-范数约束 交替投影 松弛 |
| 收稿时间： | 2016/3/11 0:00:00 |
| 修稿时间： | 2016/6/28 0:00:00 |
PROJECTION ALGORITHMS FOR THE SOLUTION OF SPLIT FEASIBILITY PROBLEM WITH 1-NORM CONSTRAINTS |
| |
| CHANG Han-xiao and QU Biao.PROJECTION ALGORITHMS FOR THE SOLUTION OF SPLIT FEASIBILITY PROBLEM WITH 1-NORM CONSTRAINTS[J].Journal of Mathematics,2017,37(6):1234-1244. |
| |
| Authors: | CHANG Han-xiao and QU Biao |
| |
| Institution: | School of Management, Qufu Normal University, Rizhao 276826, China and School of Management, Qufu Normal University, Rizhao 276826, China |
| |
| Abstract: | In this paper, we mainly study the solution algorithm of the split feasibility problem subject to 1-norm constraints. By using the alternating projections algorithm, we solve the problem successfully and propose a relaxed alternating projections algorithm which improves the shortage of projecting directly onto the closed convex set. And we obtain the convergence of this algorithm. |
| |
| Keywords: | split feasible problem 1-norm constraints alternating projections relaxed |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《数学杂志》浏览原始摘要信息 |
| 点击此处可从《数学杂志》下载免费的PDF全文 |
