@article {mansour2012IEEETITrcs,
	title = {Recovering compressively sampled signals using partial support information},
	journal = {IEEE Transactions on Information Theory},
	volume = {58},
	number = {2},
	year = {2012},
	month = {02},
	pages = {1122-1134},
	publisher = {Department of Computer Science},
	address = {University of British Columbia, Vancouver},
	abstract = {We study recovery conditions of weighted $\ell_1$ minimization for signal reconstruction from compressed sensing measurements when partial support information is available. We show that if at least 50\% of the (partial) support information is accurate, then weighted $\ell_1$ minimization is stable and robust under weaker sufficient conditions than the analogous conditions for standard $\ell_1$ minimization. Moreover, weighted $\ell_1$ minimization provides better upper bounds on the reconstruction error in terms of the measurement noise and the compressibility of the signal to be recovered. We illustrate our results with extensive numerical experiments on synthetic data and real audio and video signals.},
	keywords = {Compressive Sensing},
	doi = {10.1109/TIT.2011.2167214},
	url = {https://slim.gatech.edu/Publications/Public/Journals/IEEETransInformationTheory/2012/mansour2012IEEETITrcs/mansour2012IEEETITrcs.pdf},
	author = {Michael P. Friedlander and Hassan Mansour and Rayan Saab and Ozgur Yilmaz}
}
@article {saab2008ACHAsrb,
	title = {Sparse recovery by non-convex optimization - instance optimality},
	journal = {Applied and Computational Harmonic Analysis},
	volume = {29},
	number = {1},
	year = {2010},
	month = {07},
	pages = {30-48},
	abstract = {In this note, we address the theoretical properties of $\Delta_p$, a class of compressed sensing decoders that rely on $l^p$ minimization with $p \in (0,1)$ to recover estimates of sparse and compressible signals from incomplete and inaccurate measurements. In particular, we extend the results of Cand{\textquoteleft}es, Romberg and Tao [3] and Wojtaszczyk [30] regarding the decoder $\Delta_1$, based on $\ell^1$ minimization, to $Δp$ with $p \in (0,1)$. Our results are two-fold. First, we show that under certain sufficient conditions that are weaker than the analogous sufficient conditions for $\Delta_1$ the decoders $\Delta_p$ are robust to noise and stable in the sense that they are $(2,p)$ instance optimal. Second, we extend the results of Wojtaszczyk to show that, like $\Delta_1$, the decoders $\Delta_p$ are (2,2) instance optimal in probability provided the measurement matrix is drawn from an appropriate distribution. While the extension of the results of [3] to the setting where $p \in (0,1)$ is straightforward, the extension of the instance optimality in probability result of [30] is non-trivial. In particular, we need to prove that the $LQ_1$ property, introduced in [30], and shown to hold for Gaussian matrices and matrices whose columns are drawn uniformly from the sphere, generalizes to an $LQ_p$ property for the same classes of matrices. Our proof is based on a result by Gordon and Kalton [18] about the Banach-Mazur distances of p-convex bodies to their convex hulls.},
	keywords = {Compressive Sensing, non-convex},
	doi = {10.1016/j.acha.2009.08.002},
	url = {http://www.sciencedirect.com/science/article/pii/S1063520309000864},
	url2 = {https://slim.gatech.edu/Publications/Public/Journals/ACHA/2010/saab2008ACHAsrb/saab2008ACHAsrb.pdf},
	author = {Rayan Saab and Ozgur Yilmaz}
}
