M. Iordache, J. M. Bioucas-dias, and A. Plaza, « Sparse unmixing of hyperspectral data, IEEE Trans. Geosci. Remote Sensing, vol.49, issue.6, pp.2014-2039, 2011.

T. Virtanen, J. F. Gemmeke, and B. Raj, Active-set Newton algorithm for overcomplete non-negative representations of audio, IEEE Trans. Audio, Speech, Language Process, vol.21, issue.11, pp.2277-2289, 2013.

R. Bro and S. De-jond, « A fast non-negativity-constrained least squares algorithm, J. Chemometrics, vol.11, issue.5, pp.393-401, 1997.

S. Petra and C. Schnörr, Average case recovery analysis of tomographic compressive sensing, Linear Alg. Appl, vol.441, pp.168-198, 2014.

B. K. Natarajan, « Sparse approximate solutions to linear systems, SIAM J. Comput, vol.24, issue.2, pp.227-234, 1995.
DOI : 10.1137/s0097539792240406

G. Gasso, A. Rakotomamonjy, and S. Canu, « Recovering sparse signals with a certain family of nonconvex penalties and DC programming, IEEE Trans. Signal Process, vol.57, issue.12, pp.4686-4698, 2009.

E. Soubies, L. Blanc-féraud, and G. Aubert, « A continuous exact 0 penalty (CEL0) for least squares regularized problem », SIAM J. Imaging Sci, vol.8, issue.3, pp.1607-1639, 2015.

S. Bourguignon, J. Ninin, and H. Carfantan, Mongeau, « Exact sparse approximation problems via mixedinteger programming : Formulations and computational performance, IEEE Trans. Signal Process, vol.64, issue.6, pp.1405-1419, 2016.
DOI : 10.1109/tsp.2015.2496367
URL : https://hal.archives-ouvertes.fr/hal-01254856/file/MIP_sparse.pdf

B. L. Sturm and M. G. Christensen, « Comparison of orthogonal matching pursuit implementations, Proc. Eur. Sig. Proc. Conf., Bucarest, Roumanie, août 2012, pp.220-224

A. M. Bruckstein, M. Elad, and M. Zibulevsky, « On the uniqueness of nonnegative sparse solutions to underdetermined systems of equation, IEEE Trans. Inf. Theory, vol.54, issue.11, pp.4813-4820, 2008.

M. Yaghoobi, D. Wu, and M. E. Davies, « Fast non-negative orthogonal matching pursuit, IEEE Signal Process. Lett, vol.22, issue.9, pp.1229-1233, 2015.

T. T. Nguyen, J. Idier, C. Soussen, and E. Djermoune, Non-negative orthogonal greedy algorithms
URL : https://hal.archives-ouvertes.fr/hal-02049424

J. A. Tropp, « Greed is good : Algorithmic results for sparse approximation, IEEE Trans. Inf. Theory, vol.50, issue.10, pp.2231-2242, 2004.

T. T. Nguyen, C. Soussen, J. Idier, and E. Djermoune, « Sign preservation analysis of orthogonal greedy algorithms, 2019.

T. T. Nguyen, C. Soussen, J. Idier, and E. Djermoune, « An optimized version of non-negative OMP, Actes 26 e coll. GRETSI, 2017.

M. Yaghoobi and M. E. Davies, « Fast non-negative orthogonal least squares, Actes de la 23 e conf. EUSIPCO, Nice, août 2015, pp.479-483
DOI : 10.1109/eusipco.2015.7362429
URL : https://www.pure.ed.ac.uk/ws/files/19708315/YD_FastNNOLS_EUSIPCO_2015.pdf

C. L. Lawson and R. J. Hanson, Solving least squares problems, pp.149-199, 1974.

T. T. Cai, L. Wang, and G. Xu, « Stable recovery of sparse signals using an oracle inequality, IEEE Trans. Inf. Theory, vol.56, issue.7, pp.3516-3522

C. Herzet, C. Soussen, J. Idier, and R. Gribonval, Exact recovery conditions for sparse representations with partial support information, IEEE Trans. Inf. Theory, vol.59, issue.11, pp.7509-7524, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00907646

T. T. Nguyen, C. Soussen, J. Idier, and E. , Djermoune, « Non-negative greedy algorithms : Matlab implementation, 2019.