| 摘要: |
| 本文主要研究带1-范数约束的分裂可行问题的求解算法.用一种交替投影算法，求得了问题的解，提出松弛交替投影算法，改进了直接往闭凸集上投影这一不足，并证明了该算法的收敛性. |
| 关键词: 分裂可行问题 1-范数约束 交替投影 松弛 |
| DOI： |
| 分类号:O221.2 |
| 基金项目:国家自然科学基金（11271226）；山东省优秀中青年科学家科研奖励基金（BS2012SF027）. |
|
| PROJECTION ALGORITHMS FOR THE SOLUTION OF SPLIT FEASIBILITY PROBLEM WITH 1-NORM CONSTRAINTS |
|
CHANG Han-xiao, QU Biao
|
|
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. |
| Key words: split feasible problem 1-norm constraints alternating projections relaxed |
