A Self-adaptive Algorithm for Solving Basis Pursuit Denoising Problem
INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS(2021)
摘要
In this paper, we further consider a method for solving the basis pursuit denoising problem (BPDP), which has received considerable attention in signal processing and statistical inference. To this end, a new self-adaptive algorithm is proposed, its global convergence results is established. Furthermore, we also show that the method is sublinearly convergent rate of O(1/k). Finally, the availability of given method is shown via some numerical examples.
更多查看译文
关键词
Basis pursuit denoising problem,algorithm,global convergence,sublinearly convergent rate,sparse signal recovery
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要