E. J. Candès, Compressive sampling, Int. Congress Math., III, pp.1433-1452, 2006.
DOI : 10.4171/022-3/69

E. J. Candès, The restricted isometry property and its implications for compressed sensing, Comptes Rendus Mathematique, vol.346, issue.9-10, pp.9-10, 2008.
DOI : 10.1016/j.crma.2008.03.014

E. J. Candès and B. Recht, Exact Matrix Completion via Convex Optimization, Foundations of Computational Mathematics, vol.170, issue.1, pp.717-772, 2009.
DOI : 10.1007/s10208-009-9045-5

E. J. Candès and J. Romberg, Sparsity and incoherence in compressive sampling, Inverse Problems, vol.23, issue.3, pp.969-985, 2007.
DOI : 10.1088/0266-5611/23/3/008

E. J. Candès and T. Tao, The Power of Convex Relaxation: Near-Optimal Matrix Completion, IEEE Transactions on Information Theory, vol.56, issue.5, 2009.
DOI : 10.1109/TIT.2010.2044061

M. V. Catalisano, A. V. Geramita, and A. Gimigliano, Ranks of tensors, secant varieties of Segre varieties and fat points, Linear Algebra and its Applications, vol.355, issue.1-3, pp.1-3, 2002.
DOI : 10.1016/S0024-3795(02)00352-X

A. Cohen, W. Dahmen, and R. Devore, Compressed sensing and best $k$-term approximation, Journal of the American Mathematical Society, vol.22, issue.1, pp.211-231, 2009.
DOI : 10.1090/S0894-0347-08-00610-3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.148.5477

P. Comon, Contrasts, independent component analysis, and blind deconvolution, International Journal of Adaptive Control and Signal Processing, vol.18, issue.3, pp.225-243, 2004.
DOI : 10.1002/acs.791
URL : https://hal.archives-ouvertes.fr/hal-00542916

P. Comon, G. Golub, L. Lim, and B. Mourrain, Symmetric Tensors and Symmetric Tensor Rank, SIAM Journal on Matrix Analysis and Applications, vol.30, issue.3, pp.1254-1279, 2008.
DOI : 10.1137/060661569
URL : https://hal.archives-ouvertes.fr/hal-00327599

P. Comon and L. Lim, Sparse representations and tensor decompositions, 2010.

V. , D. Silva, and L. Lim, Tensor rank and the ill-posedness of the best low-rank approximation problem, SIAM J. Matrix Anal. Appl, vol.30, issue.3, pp.1084-1127, 2008.

H. Derksen, Sharpness of Kruskal's theorem, 2009.

D. L. Donoho, Compressed sensing, IEEE Transactions on Information Theory, vol.52, issue.4, pp.1289-1306, 2006.
DOI : 10.1109/TIT.2006.871582
URL : https://hal.archives-ouvertes.fr/inria-00369486

D. L. Donoho and M. Elad, Optimally sparse representation in general (nonorthogonal) dictionaries via ??1 minimization, Proc. Nat. Acad. Sci, pp.2197-2202, 2003.
DOI : 10.1073/pnas.0437847100

M. Duarte, M. Davenport, D. Takhar, J. Laska, T. Sun et al., Single-Pixel Imaging via Compressive Sampling, IEEE Signal Processing Magazine, vol.25, issue.2, pp.83-91, 2008.
DOI : 10.1109/MSP.2007.914730
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.703

M. Fazel, H. Hindi, and S. Boyd, A rank minimization heuristic with application to minimum order system approximation, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148), pp.4734-4739, 2001.
DOI : 10.1109/ACC.2001.945730

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

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

J. Håstad, Tensor rank is NP-complete, J. Algorithms, issue.4, pp.11-644, 1990.

F. L. Hitchcock, The Expression of a Tensor or a Polyadic as a Sum of Products, Journal of Mathematics and Physics, vol.6, issue.1-4, pp.164-189, 1927.
DOI : 10.1002/sapm192761164

C. Hillar and L. Lim, Most Tensor Problems Are NP-Hard, Journal of the ACM, vol.60, issue.6, 2009.
DOI : 10.1145/2512329
URL : http://arxiv.org/abs/0911.1393

J. M. Landsberg, Kruskal's theorem, 2009.

J. M. Landsberg and L. Manivel, On the Ideals of Secant Varieties of Segre Varieties, Foundations of Computational Mathematics, vol.4, issue.4, pp.397-422, 2004.
DOI : 10.1007/s10208-003-0115-9

L. Lim and P. Comon, Nonnegative approximations of nonnegative tensors, Journal of Chemometrics, vol.36, issue.3, pp.432-441, 2009.
DOI : 10.1002/cem.1244
URL : https://hal.archives-ouvertes.fr/hal-00410056

B. K. Natarajan, Sparse Approximate Solutions to Linear Systems, SIAM Journal on Computing, vol.24, issue.2, pp.227-234, 1995.
DOI : 10.1137/S0097539792240406

N. D. Sidiropoulos, R. Bro, and G. B. Giannakis, Parallel factor analysis in sensor array processing, IEEE Transactions on Signal Processing, vol.48, issue.8, pp.2377-2388, 2000.
DOI : 10.1109/78.852018

B. Recht, M. Fazel, and P. Parrilo, Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization, SIAM Review, vol.52, issue.3, 2008.
DOI : 10.1137/070697835

J. Rhodes, A concise proof of Kruskal???s theorem on tensor decomposition, Linear Algebra and its Applications, vol.432, issue.7, pp.1818-1824, 2010.
DOI : 10.1016/j.laa.2009.11.033

R. Roy, A. Paulraj, and T. Kailath, ESPRIT--A subspace rotation approach to estimation of parameters of cisoids in noise, IEEE Transactions on Acoustics, Speech, and Signal Processing, vol.34, issue.5, pp.1340-1344, 1986.
DOI : 10.1109/TASSP.1986.1164935

A. Stegeman and N. D. Sidiropoulos, On Kruskal???s uniqueness condition for the Candecomp/Parafac decomposition, Linear Algebra and its Applications, vol.420, issue.2-3, pp.2-3, 2007.
DOI : 10.1016/j.laa.2006.08.010

J. Tropp, Greed is Good: Algorithmic Results for Sparse Approximation, IEEE Transactions on Information Theory, vol.50, issue.10, pp.2231-2242, 2004.
DOI : 10.1109/TIT.2004.834793

A. Vardy, The intractability of computing the minimum distance of a code, IEEE Transactions on Information Theory, vol.43, issue.6, pp.1757-1766, 1997.
DOI : 10.1109/18.641542

F. L. Zak, Tangents and Secants of Algebraic Varieties, 1993.

Z. Zhu, A. M. So, and Y. Ye, Fast and near-optimal matrix completion via randomized basis pursuit, 2009.