Abstract
We propose a modified sequential quadratic programming method for solving the sparse signal recovery problem. We start by going through the well-known smoothed-ℓ0 technique and provide a smooth approximation of the objective function. Then, a variant of the sequential quadratic programming method equipped with a new approach for solving subproblems is proposed. We investigate the global convergence of the method in detail. In comparison to several well-known algorithms, simulation results demonstrate the promising performance of the proposed method.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
