A New Projection Type Algorithm for Compressive Sensing
Journal of Advances in Mathematics and Computer Science · pp. 1–11 · Published 24 Dec 2018
10.9734/JAMCS/2019/45973Abstract
Compressive sensing (CS) is to recover a sparse signal from an undetermined linear system, which has received considerable interest, and some customized iterative methods for solving CS have been proposed in recent years. In this paper, we further consider an algorithm for solving the CS. To this end, a new projection-type algorithm (PTA) is proposed to solve CS based on a new formulation of the problem, which needs only one projection onto the nonnegative quadrant and only one value of the mapping per iteration. Global convergence results of the new algorithm is established. Furthermore, we illustrate the efficiency of given algorithm through some numerical examples on sparse signal recovery.
Cited by 1
Meng-yao Zhu, Xu Zhang, Bing Xue · 2021
Related research
Article metrics
Real usage data collected on this platform.
20
Page views
0
PDF downloads
1
Outbound clicks
1
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.