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

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

M. Yaghoobi, T. Blumensath, and M. E. 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

R. Rubinstein, A. M. Bruckstein, and M. Elad, Dictionaries for Sparse Representation Modeling, Proceedings of the IEEE, pp.1045-1057, 2010.
DOI : 10.1109/JPROC.2010.2040551
URL : https://hal.archives-ouvertes.fr/inria-00565811

R. Rubinstein, M. Zibulevsky, and M. Elad, Double Sparsity: Learning Sparse Dictionaries for Sparse Signal Approximation, IEEE Transactions on Signal Processing, vol.58, issue.3, pp.1553-1564, 2010.
DOI : 10.1109/TSP.2009.2036477

V. Cevher and A. Krause, Greedy Dictionary Selection for Sparse Representation, IEEE Journal of Selected Topics in Signal Processing, vol.5, issue.5, pp.979-988, 2011.
DOI : 10.1109/JSTSP.2011.2161862

M. Yaghoobi, L. Daudet, and D. M. , Optimal dictionary selection using an overcomplete joint sparsity model, 1212.

C. Bilen, G. Puy, R. Gribonval, and L. Daudet, Convex Optimization Approaches for Blind Sensor Calibration using Sparsity ArXiv e-prints, 2013.

H. W. Kuhn, The Hungarian method for the assignment problem, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.83-97, 1955.
DOI : 10.1002/nav.3800020109

E. L. Lawler and D. E. Wood, Branch-and-Bound Methods: A Survey, Operations Research, vol.14, issue.4, pp.699-719, 1966.
DOI : 10.1287/opre.14.4.699

S. Boyd and J. Mattingley, Branch and bound methods, 2007.

M. Grant and S. Boyd, CVX: Matlab software for disciplined convex programming, version 2.0 beta, 2013.

N. Börlin, Functions related to the assignment problem, version 1.0, 1999.

E. Candès and J. Romberg, l1-magic: Recovery of Sparse Signals via Convex Programming, 2005.