Abstract
AbstractIn 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
