D. L. Scott-shaobing-chen, M. A. Donoho, and . Saunders, Atomic Decomposition by Basis Pursuit, SIAM Journal on Scientific Computing, vol.20, issue.1, pp.33-61, 1999.
DOI : 10.1137/S1064827596304010

M. Elad and M. Aharon, Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries, IEEE Transactions on Image Processing, vol.15, issue.12, pp.3736-3745, 2006.
DOI : 10.1109/TIP.2006.881969
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.6477

R. Tibshirani, Regression shrinkage and selection via the lasso, Journal of The Royal Statistical Society Series B, vol.58, issue.1, pp.267-288, 1996.
DOI : 10.1111/j.1467-9868.2011.00771.x

S. Mallat and Z. Zhang, Matching pursuits with time-frequency dictionaries, IEEE Transactions on Signal Processing, vol.41, issue.12, pp.3397-3415, 1993.
DOI : 10.1109/78.258082
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.335.5769

B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani, Least angle regression, Ann. Stat, vol.32, p.407, 2004.

E. J. Candès and T. Tao, Decoding by Linear Programming, IEEE Transactions on Information Theory, vol.51, issue.12, pp.4203-4215, 2005.
DOI : 10.1109/TIT.2005.858979

P. Zhao and B. Yu, On model selection consistency of Lasso, J. Mach. Learn. Res, vol.7, pp.2541-2563, 2006.

B. A. Olshausen and D. J. Field, Sparse coding with an overcomplete basis set: A strategy employed by V1?, Vision Research, vol.37, issue.23, pp.3311-3325, 1997.
DOI : 10.1016/S0042-6989(97)00169-7
URL : http://doi.org/10.1016/s0042-6989(97)00169-7

C. Ding, T. Li, and M. I. Jordan, Convex and Semi-Nonnegative Matrix Factorizations, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.32, issue.1, 2006.
DOI : 10.1109/TPAMI.2008.277
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.3887

M. Aharon, M. Elad, and A. Bruckstein, <tex>$rm K$</tex>-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation, IEEE Transactions on Signal Processing, vol.54, issue.11, pp.4311-4322, 2006.
DOI : 10.1109/TSP.2006.881199

H. Lee, R. Battle, A. Y. Raina, and . Ng, Efficient sparse coding algorithms, NIPS, 2007.

N. Srebro, J. D. Rennie, and T. S. Jaakkola, Maximum-margin matrix factorization, NIPS, 2005.

S. Boyd and L. Vandenberghe, Convex Optimization, 2003.

F. R. Bach, Consistency of trace norm minimization, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00179522

A. Blake and A. Zisserman, Visual Reconstruction, 1987.

S. A. Burer and R. D. Monteiro, Local Minima and Convergence in Low-Rank Semidefinite Programming, Mathematical Programming, vol.2, issue.3, pp.427-444, 2005.
DOI : 10.1007/s10107-004-0564-1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.7257

A. , E. L. Ghaoui, M. I. Jordan, and G. R. Lanckriet, A direct formulation for sparse PCA using semidefinite programming, SIAM Review, vol.49, issue.3, pp.434-482, 2007.

H. Zou, T. Hastie, and R. Tibshirani, Sparse Principal Component Analysis, Journal of Computational and Graphical Statistics, vol.15, issue.2, pp.265-286, 2006.
DOI : 10.1198/106186006X113430