R. Tibshirani, Regression shrinkage and selection via the lasso, Journal of the Royal Statistical Society. Series B, pp.267-288, 1996.

S. Chen, D. Donoho, and M. Saunders, Atomic Decomposition by Basis Pursuit, SIAM Journal on Scientific Computing, vol.20, issue.1, pp.33-61, 1998.
DOI : 10.1137/S1064827596304010

H. Jégou, T. Furon, and J. Fuchs, Anti-sparse coding for approximate nearest neighbor search, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp.2029-2032, 2012.
DOI : 10.1109/ICASSP.2012.6288307

J. Fuchs, On sparse representations in arbitrary redundant bases Information Theory, IEEE Transactions on, vol.50, issue.6, pp.1341-1344, 2004.

S. Vaiter, G. Peyré, C. Dossal, and J. Fadili, Robust Sparse Analysis Regularization, IEEE Transactions on Information Theory, 2012.
DOI : 10.1109/TIT.2012.2233859
URL : https://hal.archives-ouvertes.fr/hal-00627452

F. Bach, Structured sparsity-inducing norms through submodular functions, Advances in Neural Information Processing Systems, 2010.
DOI : 10.1214/12-sts394
URL : https://hal.archives-ouvertes.fr/hal-00511310

S. Petry and G. Tutz, Shrinkage and variable selection by polytopes, Journal of Statistical Planning and Inference, vol.142, issue.1, pp.48-64, 2012.
DOI : 10.1016/j.jspi.2011.06.020

M. Moeller and M. Burger, Multiscale Methods for Polyhedral Regularizations, SIAM Journal on Optimization, vol.23, issue.3, pp.11-74, 2011.
DOI : 10.1137/110858136

D. Donoho and J. Tanner, Counting the Faces of Randomly-Projected Hypercubes and Orthants, with Applications, Discrete & Computational Geometry, vol.42, issue.2, pp.522-541, 2010.
DOI : 10.1007/s00454-009-9221-z

V. Chandrasekaran, B. Recht, P. A. Parrilo, and A. S. Willsky, The Convex Geometry of Linear Inverse Problems, Foundations of Computational Mathematics, vol.1, issue.10, pp.805-849, 2012.
DOI : 10.1007/s10208-012-9135-7