首页 | 官方网站   微博 | 高级检索  
     

线性方程组l_1范数问题的松弛投影算法及其应用
引用本文:屈彪,张文伟,于丽超.线性方程组l_1范数问题的松弛投影算法及其应用[J].运筹学学报,2017,21(2):57-65.
作者姓名:屈彪  张文伟  于丽超
作者单位:1. 曲阜师范大学管理学院、运筹学研究所, 山东日照 276826
基金项目:国家自然科学基金(No. 11271226)
摘    要:考虑线性方程组l_1范数问题的求解,在分别将其转化为一个分裂可行问题和凸可行问题的基础上,设计了几种松弛投影算法,然后将所设计的求解方法用于信号处理问题的求解上.

关 键 词:线性方程组  l_1范数问题  松弛投影算法  
收稿时间:2017-03-24

The relaxed projection methods for solving the l_1-norm problem of linear equations and their applications
QU Biao,ZHANG Wenwei,YU Lichao.The relaxed projection methods for solving the l_1-norm problem of linear equations and their applications[J].OR Transactions,2017,21(2):57-65.
Authors:QU Biao  ZHANG Wenwei  YU Lichao
Affiliation:1. Institute of Operations Research, School of Management, Qufu Normal University, Rizhao 276826, Shandong,  China
Abstract:This paper discusses of the methods for solving the l_1-norm problem of linear equations. First, the problem is translated into a split feasibility problem and a convex feasibility problem, respectively. Then,some relaxed projection algorithms are presented. Finally, the new algorithms are applied to solve some signal processing problems.
Keywords:linear equations  l_1-norm problem  relaxed projection algorithm  
本文献已被 CNKI 等数据库收录!
点击此处可从《运筹学学报》浏览原始摘要信息
点击此处可从《运筹学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号