Paper detail

Newton-Step-Based Hard Thresholding Algorithms for Sparse Signal Recovery

Sparse signal recovery or compressed sensing can be formulated as certain sparse optimization problems. The classic optimization theory indicates that the Newton-like method often has a numerical advantage over the gradient method for nonlinear optimization problems. In this paper, we propose the so-called Newton-step-based iterative hard thresholding (NSIHT) and the Newton-step-based hard thresholding pursuit (NSHTP) algorithms for sparse signal recovery and signal approximation. Different from the traditional iterative hard thresholding (IHT) and hard thresholding pursuit (HTP), the proposed algorithms adopts the Newton-like search direction instead of the steepest descent direction. A theoretical analysis for the proposed algorithms is carried out, and some sufficient conditions for the guaranteed success of sparse signal recovery via these algorithms are established. Our results are shown under the restricted isometry property which is one of the standard assumptions widely used in the field of compressed sensing and signal approximation. The empirical results obtained from synthetic data recovery indicate that the proposed algorithms are efficient signal recovery methods. The numerical stability of our algorithms in terms of the residual reduction is also investigated through simulations.