Abstract
ABSTRACTThe nonconvex regularization, which has superiority on sparsity-inducing over the convex counterparts, has been proposed in many areas of engineering and science. In this paper, we present an accelerated regularization thresholding algorithm for sparse signal recovery, which can be viewed as an extension of the well-known Nesterov's accelerated gradient method from convex optimization to nonconvex case. It has shown numerically that the proposed algorithm keeps fast convergence, and also maintains high recovery precision. Extensive numerical experiments have been to demonstrate the effectiveness of the proposed algorithm. It is also mentioned that the proposed algorithm has much faster convergence and higher recovery precision in sparse signal recovery over the commonly non-accelerated thresholding algorithm.
Sign-in/Register to access full text options 
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
