The algorithms for solving (REF ) can be sorted into several categories including convex optimization methods, heuristic algorithms, and thresholding algorithms.
The convex optimization methods include \(\ell _1\) -minimization [1]}, [2]}, reweighted \(\ell _1\) -minimization [3]}, [4]}, and dual-density-based reweighted \(\ell _1\) -minimization [5]}, [6]}, [7]}.
The heuristic-type methods include orthogonal matching pursuit (OMP) [8]}, [9]}, [10]}, compressive sampling matching pursuit (CoSaMP) [11]}, subspace pursuit (SP) [12]}, [13]}, and their variants.
Thresholding-type algorithms attract much attention due to their easy implementation and low computational complexity [14]}, [15]}, [16]}, [17]}, [18]}, [19]}, [20]}.
