.png){kind=icon}
返回
An iteratively approximated gradient projection algorithm for sparse signal reconstruction
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2013.10.063.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we developed an iteratively approximated gradient projection algorithm for l(1)-minimization problems arising from sparse signal reconstruction in compressive sensing. By introducing a relaxed variable, the noisy problem can be transformed into the problem with equality constraints. The nonsmooth l(1) term was tackled by variable-splitting techniques. Thus the problem was transformed into a quadratic programming problem. All linear variables in the objective function were imposed on l(2) regularization. Based on ideas of quasi-Lagrangian functions and partial duality, a reduced quadratic programming problem can be obtained iteratively. At each iteration, we applied gradient projection methods with approximated gradients to get the next iterates. The computational experiments show the proposed method is very effective. (c) 2013 Elsevier Inc. All rights reserved.
Keyword:
Sparse signal reconstruction
Quadratic programming
Gradient projection methods
Nonnegative constraints
Quasi-Lagrangian function
Partial duality
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
Graphene/Ionic Liquid Binary Electrode Material for High Performance Supercapacitor用于高性能超级电容器的石墨烯/离子液体二元电极材料
PREAI
分享收藏Hydrolysis of Dinucleoside Monophosphates Containing Arabinose in Various Internucleotide Linkages by Exonuclease from the Venom of Crotalus adamanteus*.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏
查看更多内容