%0 Journal Article
%T 带1-范数约束的分裂可行问题的投影算法<br>PROJECTION ALGORITHMS FOR THE SOLUTION OF SPLIT FEASIBILITY PROBLEM WITH 1-NORM CONSTRAINTS
%A 作者
%A 畅含笑
%A 屈彪
%J 数学杂志
%D 2017
%X 本文主要研究带1-范数约束的分裂可行问题的求解算法.用一种交替投影算法，求得了问题的解，提出松弛交替投影算法，改进了直接往闭凸集上投影这一不足，并证明了该算法的收敛性.<br>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
%K 分裂可行问题 1-范数约束 交替投影 松弛&lt
%K br&gt
%K split feasible problem 1-norm constraints alternating projections relaxed
%U http://sxzz.whu.edu.cn/sxzz/ch/reader/view_abstract.aspx?file_no=20170616&flag=1