Abstract
In this chapter we present an appealing and surprising alternative pursuit algorithm for sparse approximation. This algorithm is competitive with the Basis Pursuit Denoising (BPDN) and the OMP. This algorithm was proposed in 2007 by Candes and Tao, and termed Dantzig-Selector (DS). The name chosen pays tribute to George Dantzig, the father of the simplex algorithm that solves Linear Programming (LP) problems. The connection to LP will become evident shortly.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Further Reading
Z. Ben-Haim, Y.C. Eldar, and M. Elad, Coherence-based performance guarantees for estimating a sparse vector under random noise, submitted to IEEE Transactions on Signal Processing, 2009.
P.J. Bickel, Y. Ritov, and A. Tsybakov, Simultaneous analysis of Lasso and Dantzig selector, to appear in Ann. Statist., 2008.
E.J. Candès and T. Tao, Decoding by linear programming, IEEE Trans. on Information Theory, 51(12):4203–4215, December 2005.
E.J. Candès and T. Tao, The Dantzig selector: Statistical estimation when p is much larger than n, Annals of Statistics, 35(6):2313–2351, June 2007.
G.M. James, P. Radchenko, and J. Lv, DASSO: connections between the Dantzig selector and lasso, Journal of the Royal Statist. Soc. B, 71(1):127–142, 2009.
N. Meinshausen, G. Rocha, and B. Yu, Discussion: A tale of three cousins: Lasso, L2Boosting and Dantzig, Ann. Statist., 35(6):2373–2384, 2007.
J.L. Starck, D.L. Donoho and E. Candès, Very high quality image restoration, in SPIE conference on Signal and Image Processing: Wavelet Applications in Signal and Image Processing IX, Vol 4478, 2001.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Elad, M. (2010). The Dantzig-Selector Algorithm. In: Sparse and Redundant Representations. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-7011-4_8
Download citation
DOI: https://doi.org/10.1007/978-1-4419-7011-4_8
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-7010-7
Online ISBN: 978-1-4419-7011-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)