A simpler approach to weighted ℓ1 minimization
暂无分享,去创建一个
[1] Y. Gordon. On Milman's inequality and random subspaces which escape through a mesh in ℝ n , 1988 .
[2] Alex Samorodnitsky,et al. Random weighting, asymptotic counting, and inverse isoperimetry , 2005, Electron. Colloquium Comput. Complex..
[3] Emmanuel J. Candès,et al. Decoding by linear programming , 2005, IEEE Transactions on Information Theory.
[4] D. Donoho,et al. Neighborliness of randomly projected simplices in high dimensions. , 2005, Proceedings of the National Academy of Sciences of the United States of America.
[5] D. Donoho,et al. Sparse nonnegative solution of underdetermined linear equations by linear programming. , 2005, Proceedings of the National Academy of Sciences of the United States of America.
[6] David L. Donoho,et al. High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension , 2006, Discret. Comput. Geom..
[7] M. Rudelson,et al. On sparse reconstruction from Fourier and Gaussian measurements , 2008 .
[8] Mihailo Stojnic,et al. Various thresholds for ℓ1-optimization in compressed sensing , 2009, ArXiv.
[9] Mihailo Stojnic,et al. Block-length dependent thresholds in block-sparse compressed sensing , 2009, ArXiv.
[10] M. Stojnic. Various thresholds for $\ell_1$-optimization in compressed sensing , 2009 .
[11] Babak Hassibi,et al. Weighted compressed sensing and rank minimization , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).
[12] Weiyu Xu,et al. Analyzing Weighted $\ell_1$ Minimization for Sparse Recovery With Nonuniform Sparse Models , 2010, IEEE Transactions on Signal Processing.
[13] Pablo A. Parrilo,et al. The Convex Geometry of Linear Inverse Problems , 2010, Foundations of Computational Mathematics.