A fast algorithm for sparse signal recovery via fraction function
In this article, a fast algorithm is studied to recover the sparse signals. It can be regarded as an extension of the parameterized fast iterative shrinkage‐thresholding algorithm from convex optimization to nonconvex optimization. Numerical results show that the proposed fast algorithm is efficient...
Saved in:
| Published in | Electronics letters Vol. 60; no. 11 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Wiley
01.06.2024
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 0013-5194 1350-911X 1350-911X |
| DOI | 10.1049/ell2.13243 |
Cover
| Summary: | In this article, a fast algorithm is studied to recover the sparse signals. It can be regarded as an extension of the parameterized fast iterative shrinkage‐thresholding algorithm from convex optimization to nonconvex optimization. Numerical results show that the proposed fast algorithm is efficient and fast in recovering the sparse signals.
A fast algorithm is proposed to recover the sparse signals. Numerical results show that the proposed fast algorithm is efficient and fast in recovering the sparse signals. |
|---|---|
| ISSN: | 0013-5194 1350-911X 1350-911X |
| DOI: | 10.1049/ell2.13243 |