数学杂志2017,Vol.37Issue(6):1234-1244,11.
带1-范数约束的分裂可行问题的投影算法
PROJECTION ALGORITHMS FOR THE SOLUTION OF SPLIT FEASIBILITY PROBLEM WITH 1-NORM CONSTRAINTS
摘要
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.关键词
分裂可行问题/1-范数约束/交替投影/松弛Key words
split feasible problem/1-norm constraints/alternating projections/relaxed分类
数理科学引用本文复制引用
畅含笑,屈彪..带1-范数约束的分裂可行问题的投影算法[J].数学杂志,2017,37(6):1234-1244,11.基金项目
国家自然科学基金(11271226) (11271226)
山东省优秀中青年科学家科研奖励基金(BS2012SF027). (BS2012SF027)