S. Foucarts and M. J. Lai, “Sparsest Solutions of Underdetermined Linear Systems via lq-Minimization for 0 < q ≤ 1,” Applied and Computational Harmonic Analysis, Vol. 26, No. 3, 2009, pp. 395-407.
http://dx.doi.org/10.1016/j.acha.2008.09.001

has been cited by the following article:

• TITLE: Numerical Studies of the Generalized l1Greedy Algorithm for Sparse Signals

  AUTHORS: Fangjun Arroyo, Edward Arroyo, Xiezhang Li, Jiehua Zhu, Jiehua Zhu

  KEYWORDS: Compressed Sensing; Gaussian Sparse Signals; l1-Minimization; Reweighted l1-Minimization; l1; Greedy Algorithm Generalized l1 Greedy Algorithm

  JOURNAL NAME: Advances in Computed Tomography, Vol.2 No.4, December 24, 2013

  ABSTRACT: The generalized l1 greedy algorithm was recently introduced and used to reconstruct medical images in computerized tomography in the compressed sensing framework via total variation minimization. Experimental results showed that this algorithm is superior to the reweighted l1-minimization and l1 greedy algorithms in reconstructing these medical images. In this paper the effectiveness of the generalized l1 greedy algorithm in finding random sparse signals from underdetermined linear systems is investigated. A series of numerical experiments demonstrate that the generalized l1 greedy algorithm is superior to the reweighted l1-minimization and l1 greedy algorithms in the successful recovery of randomly generated Gaussian sparse signals from data generated by Gaussian random matrices. In particular, the generalized l1 greedy algorithm performs extraordinarily well in recovering random sparse signals with nonzero small entries. The stability of the generalized l1 greedy algorithm with respect to its parameters and the impact of noise on the recovery of Gaussian sparse signals are also studied.