M. Aharon, E. Elad, and A. M. 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

J. Dattorro, Convex Optimization and Euclidean Distance Geometry, v2009.06.18), 2009.

M. E. Davies, M. Elad, R. Gribonval, and S. Nam, Sparse analysis models and algorithms

M. E. Davies, R. Gribonval, S. Nam, and M. Yaghoobi, A theorem on analysis operator learning

M. Elad and A. M. Bruckstein, A generalized uncertainty principle and sparse representation in pairs of bases, IEEE Transactions on Information Theory, vol.48, issue.9, pp.2558-2567, 2002.
DOI : 10.1109/TIT.2002.801410

Q. Geng, H. Wang, and J. Wright, On the local correctness of l1 minimization for dictionary learning, 2011.

R. Gribonval and M. Nielsen, Sparse representations in unions of bases, IEEE Transactions on Information Theory, vol.49, issue.12, pp.3320-3325, 2003.
DOI : 10.1109/TIT.2003.820031
URL : https://hal.archives-ouvertes.fr/inria-00570057

R. Gribonval and K. Schnass, Dictionary identification sparse matrix-factorisation via 1 minimisation, IEEE Trans. on Information Theory, vol.56, issue.7, pp.3523-3539, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00541297

D. Gross, Recovering Low-Rank Matrices From Few Coefficients in Any Basis, IEEE Transactions on Information Theory, vol.57, issue.3, 2009.
DOI : 10.1109/TIT.2011.2104999

F. Jaillet, R. Gribonval, M. D. Plumbley, and H. Zayyani, An L1 criterion for dictionary learning by subspace identification, 2010 IEEE International Conference on Acoustics, Speech and Signal Processing, 2010.
DOI : 10.1109/ICASSP.2010.5495206
URL : https://hal.archives-ouvertes.fr/hal-00474328

M. S. Lewicki and T. J. Sejnowski, Learning Overcomplete Representations, Neural Computation, vol.33, issue.2, pp.337-365, 2000.
DOI : 10.1109/18.119725
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.7690

J. Mairal, F. Bach, J. Ponce, and G. Sapiro, Online learning for matrix factorization and sparse coding, Journal of Machine Learning Research, vol.11, pp.19-60, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00408716

S. Nam, M. E. Davies, M. Elad, and R. Gribonval, Cosparse analysis modeling - uniqueness and algorithms, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2011.
DOI : 10.1109/ICASSP.2011.5947680
URL : https://hal.archives-ouvertes.fr/inria-00557933

B. A. Olshausen and D. J. Field, Sparse coding with an overcomplete basis set: a strategy employed by V1? Vision Research, pp.3311-3325, 1997.

M. D. Plumbley, Dictionary Learning for L1-Exact Sparse Coding, International Conference on Independent Component Analysis and Signal Separation, 2007.
DOI : 10.1007/978-3-540-74494-8_51

R. Rubinstein, Training analysis operators. SMALL project, internal technical report, 2009.

J. A. Tropp, I. S. Dhillon, R. W. Heath-jr, and T. Strohmer, Designing structured tight frames via an alternating projection method, IEEE Transactions on Information Theory, vol.51, issue.1, pp.188-209, 2005.
DOI : 10.1109/TIT.2004.839492
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.5043

M. Yaghoobi, T. Blumensath, and M. Davies, Dictionary Learning for Sparse Approximations With the Majorization Method, IEEE Transactions on Signal Processing, vol.57, issue.6, pp.2178-2191, 2009.
DOI : 10.1109/TSP.2009.2016257

M. Yaghoobi and M. Davies, Dictionary Learning for Sparse Representations: A Pareto Curve Root Finding Approach, Lecture notes in computer science, pp.410-417, 2010.
DOI : 10.1007/978-3-642-15995-4_51
URL : https://hal.archives-ouvertes.fr/inria-00567528