| 注册
首页|期刊导航|数学杂志|带1-范数约束的分裂可行问题的投影算法

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

畅含笑 屈彪

数学杂志2017,Vol.37Issue(6):1234-1244,11.
数学杂志2017,Vol.37Issue(6):1234-1244,11.

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

PROJECTION ALGORITHMS FOR THE SOLUTION OF SPLIT FEASIBILITY PROBLEM WITH 1-NORM CONSTRAINTS

畅含笑 1屈彪1

作者信息

  • 1. 曲阜师范大学管理学院,山东日照276826
  • 折叠

摘要

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)

数学杂志

OACSTPCD

0255-7797

访问量0
|
下载量0
段落导航相关论文