“…The reweighted 1minimization may perform better than 1 -minimization on sparse signal recovery when the initial point is suitably chosen (see, e.g., [8,9,15,22,35,38]). Although this paper focuses on the study of reweighted algorithms, it is worth mentioning that there exist other types of algorithms for 0 -minimization problems, which have also been widely studied in the CS literature, such as orthogonal matching pursuits [14,25,30], compressed sampling matching pursuits [16,27], subspace pursuits [10,16], thresholding algorithms [3,11,14,16,26], and the newly developed optimal k-thresholding algorithms [36].…”