带1-范数约束的分裂可行问题的投影算法

摘要

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.%本文主要研究带1-范数约束的分裂可行问题的求解算法.用一种交替投影算法,求得了问题的解,提出松弛交替投影算法,改进了直接往闭凸集上投影这一不足,并证明了该算法的收敛性.