T. [ait, A new sparsity based particle image reconstruction approach for particle detection, ISPIV, vol.40, 2019.

K. Amaldi, E. Amaldi, and V. Kann, On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems, Theoretical Computer Science, vol.209, issue.1, p.88, 1998.

H. Barbu, I. Barbu, and C. Herzet, A new approach for volume reconstruction in tomoPIV with the alternating direction method of multipliers, Measurement Science and Technology, vol.27, issue.10, p.104002, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01419329

T. Beck, A. Beck, and M. Teboulle, A fast iterative shrinkagethresholding algorithm for linear inverse problems, SIAM Journal on Imaging Sciences, vol.2, issue.1, p.13, 2009.

[. Belmerhnia, Simultaneous regularized sparse approximation for wood wastes NIR spectra features selection, Proc. CAMSAP, p.42, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01241851

. Ben-haim, Coherence-based performance guarantees for estimating a sparse vector under random noise, IEEE Trans. Signal Process, vol.58, issue.10, pp.5030-5043, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00567465

T. Bendory, Robust recovery of positive stream of pulses, IEEE Trans. Signal Process, vol.65, issue.8, p.73, 2017.

[. Benvenuto, Nonnegative least-squares image deblurring: improved gradient projection approaches, Inverse Probl, vol.26, issue.2, pp.1-18, 2010.

. Bioucas-dias, Hyperspectral unmixing overview: Geometrical, statistical, and sparse regression-based approaches, IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, vol.5, issue.2, pp.354-379, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00760787

A. Björck and P. A. Philadephia, Numerical Methods for Least Squares Problems, Society for Industrial and Applied Mathematics, 1996.

T. Blumensath and M. E. Davies, On the difference between Orthogonal Matching Pursuit and Orthogonal Least Squares, vol.12, 2007.

T. Blumensath and M. E. Davies, Iterative thresholding for sparse approximations, J. Fourier Anal. Appl, vol.14, issue.5, pp.629-654, 2008.

T. Blumensath and M. E. Davies, Normalized iterative hard thresholding: Guaranteed stability and performance, IEEE Journal of Selected Topics in Signal Processing, vol.4, issue.2, pp.298-309, 2010.

[. Bonnefoy, Dynamic screening: Accelerating first-order algorithms for the lasso and group-lasso, IEEE Trans. Signal Process, vol.63, p.31, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01084986

[. Bourguignon, Exact sparse approximation problems via mixed-integer programming: Formulations and computational performance, IEEE Trans. Signal Process, vol.64, issue.6, pp.1405-1419, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01254856

[. Boyd, Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning, vol.3, pp.1-122, 2011.

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

[. Bruckstein, On the uniqueness of nonnegative sparse solutions to underdetermined systems of equation, IEEE Trans. Inf. Theory, vol.54, issue.11, pp.4813-4820, 2008.

[. Cai, T. T. Wang-;-cai, and L. Wang, Orthogonal matching pursuit for sparse signal recovery with noise, IEEE Trans. Inf. Theory, vol.57, issue.7, pp.4680-4688, 2011.

[. Cai, Stable recovery of sparse signals using an oracle inequality, IEEE Trans. Inf. Theory, vol.56, issue.7, pp.3516-3522, 2010.

. Candes, Enhancing sparsity by reweighted l1 minimization, Journal of Fourier Analysis and Applications, vol.14, issue.5, p.14, 2008.

E. Carcreff, Deconvolution adaptative pour le controle non destructif par ultrasons, p.41, 2014.
URL : https://hal.archives-ouvertes.fr/tel-01098798

[. Chen, Orthogonal least squares methods and their application to non-linear system identification, Int. J. Control, vol.50, issue.5, pp.1873-1896, 1989.

[. Chen, Atomic decomposition by basis pursuit, SIAM Review, vol.43, issue.1, p.13, 2001.

[. Chen, Complexity of unconstrained l2-lp minimization, Mathematical Programming, vol.84, issue.143, p.83, 2014.

[. Chen, Lower bound theory of nonzero entries in solutions of 2 -p minimization, SIAM J. Sci. Comput, vol.32, issue.5, p.28, 2010.

P. Combettes, P. L. Combettes, and J. Pesquet, Proximal splitting methods in signal processing, vol.20, pp.185-212, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00643807

[. Cotter, Forward sequential algorithms for best basis selection, IEE Proc. Vision, Image and Signal Processing, vol.146, pp.235-244, 1999.

M. Dai, W. Dai, and O. Milenkovic, Subspace pursuit for compressive sensing signal reconstruction, IEEE Transactions on Information Theory, vol.55, issue.5, pp.2230-2249, 2009.

W. Davenport, M. A. Davenport, and M. B. Wakin, Analysis of orthogonal matching pursuit using the restricted isometry property, IEEE Trans. Inf. Theory, vol.56, issue.9, pp.4395-4401, 2010.

. Davis, Adaptive greedy approximations, Constructive Approximation, vol.13, pp.57-98, 1997.

D. L. Donoho and M. Elad, Optimally sparse representation in general (non-orthogonal) dictionaries via 1 minimization, Proc. Natl. Acad. Sci. usa, vol.100, p.66, 2003.

[. Donoho, Stable recovery of sparse overcomplete representations in the presence of noise, IEEE Trans. Inf. Theory, vol.52, issue.1, pp.6-18, 2006.

D. L. Donoho and Y. Tsaig, Fast solution of 1 -norm minimization problems when the solution may be sparse, IEEE Trans. Inf. Theory, vol.54, issue.11, pp.4789-4812, 2008.

. Efron, Least angle regression, Ann. Statist, vol.32, issue.2, pp.407-499, 2004.

M. Elad, Sparse and redundant representations: From theory to applications in signal and image processing, vol.83, 2010.

[. Elsinga, Tomographic particle image velocimetry, Experiments in Fluids, vol.41, issue.6, pp.933-947, 2006.

[. Elvira, OMP and continuous dictionaries: is k-step recovery possible?, ICASSP 2019 -2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), vol.40, pp.5546-5550, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02049486

[. Esser, A method for finding structured sparse solutions to nonnegative least squares problems with applications, SIAM J. Imaging Sci, vol.6, issue.4, pp.2010-2046, 2013.

. Fan, J. Li-;-fan, and R. Li, Variable selection via nonconcave penalized likelihood and its oracle properties, Journal of the American Statistical Association, vol.96, issue.456, p.14, 2001.

S. Foucart, Hard thresholding pursuit: An algorithm for compressive sensing, SIAM Journal on Numerical Analysis, vol.49, issue.6, pp.2543-2563, 2011.

S. ;. Foucart, L. De-carli, A. Petukhov, A. M. Stokolos, and B. D. Wick, Stability and robustness of weak orthogonal matching pursuits, Recent advances in harmonic analysis and applications, vol.25, pp.395-405, 2013.

K. Foucart, S. Foucart, and D. Koslicki, Sparse recovery by means of nonnegative least squares, IEEE Signal Process. Lett, vol.21, issue.4, p.31, 2014.

S. Foucart and H. Rauhut, A mathematical introduction to compressive sensing. Applied and Numerical Harmonic Analysis. Birkhäuser, Basel, vol.74, 2013.

F. Frank, I. Frank, and J. Friedman, A statistical view of some chemometrics regression tools, Technometrics, vol.35, issue.2, p.14, 1993.

[. Friedman, Sparse inverse covariance estimation with the graphical lasso, Biostatistics, vol.9, issue.3, p.13, 2007.

J. Fuchs, On sparse representations in arbitrary redundant bases, IEEE Trans. Inf. Theory, vol.50, issue.6, p.67, 2004.

J. Garey, M. R. Garey, and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, vol.88, 1979.

[. Gasso, 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.
URL : https://hal.archives-ouvertes.fr/hal-00439453

[. Golub, G. H. Van-loan-;-golub, and C. F. Van-loan, Matrix Computations, vol.34, 1996.

C. Herzet and A. Drémeau, Bayesian pursuit algorithms, Proc. Eur. Sig. Proc. Conf, vol.28, pp.1474-1478, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00673801

[. Herzet, Relaxed recovery conditions for OMP/OLS by exploiting both coherence and decay, IEEE Trans. Inf. Theory, vol.62, issue.1, pp.459-470, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01058077

[. Herzet, 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

J. A. Högbom, Aperture synthesis with a non-regular distribution of interferometer baselines, Astron. Astrophys. Suppl, vol.15, pp.417-426, 1974.

P. O. Hoyer, Non-negative matrix factorization with sparseness constraints, J. Mach. Learning Res, vol.5, pp.1457-1469, 2004.

[. Huang, Asymptotic properties of bridge estimators in sparse high-dimensional regression models, Ann. Statist, vol.36, issue.2, p.14, 2008.

C. Huo, X. Huo, and J. Chen, Complexity of penalized likelihood estimation, J. Statist. Comput. Simul, vol.80, issue.7, pp.747-759, 2010.

N. Huo, X. Huo, and X. Ni, When do stepwise algorithms meet subset selection criteria?, Annals Statist, vol.35, issue.2, pp.870-887, 2007.

[. Iordache, Sparse unmixing of hyperspectral data, IEEE Trans. Geosci. Remote Sensing, vol.49, issue.6, pp.2014-2039, 2011.

N. Keshava and J. F. Mustard, Spectral unmixing, IEEE Signal Processing Magazine, vol.19, issue.1, pp.44-57, 2002.

H. Kim, D. Kim, and J. P. Haldar, Greedy algorithms for nonnegativityconstrained simultaneous sparse recovery, Signal Process, vol.125, pp.274-289, 2016.

H. Lawson, C. L. Lawson, and R. J. Hanson, Solving least squares problems, Society for Industrial and Applied Mathematics, pp.149-199, 1974.

T. [le, Sparse signal recovery by difference of convex functions algorithms, Intelligent Information and Database Systems, vol.7803, pp.387-397, 2013.

J. V. Leeuwen, Handbook of theoretical computer science, vol.86, 1990.

[. Leichner, A strictly improving linear programming Phase I algorithm, Ann. Oper. Res, vol.47, pp.409-430, 1993.

[. Li, Sufficient conditions for generalized orthogonal matching pursuit in noisy case, Signal Process, vol.108, pp.111-123, 2015.

. Lin, Sparsity constrained mixture modeling for the estimation of kinetic parameters in dynamic PET, IEEE Trans. Med. Imag, vol.33, issue.1, pp.173-185, 2014.

. Mallat, S. G. Zhang-;-mallat, and Z. Zhang, Matching pursuits with timefrequency dictionaries, IEEE Transactions on Signal Processing, vol.41, issue.12, pp.3397-3415, 1993.

A. J. Miller, Subset selection in regression, vol.20, 2002.

H. Mortada, Separation of parameterized and delayed sources : application to spectroscopic and multispectral data, Mortada, 2018.
URL : https://hal.archives-ouvertes.fr/tel-02163202

[. Morup, Approximate l0 constrained non-negative matrix and tensor factorization, IEEE International Symposium on Circuits and Systems, pp.1328-1331, 2008.

B. K. Natarajan, Sparse approximate solutions to linear systems, SIAM J. Comput, vol.24, issue.2, pp.227-234, 1995.

D. Needell and J. A. Tropp, CoSaMP: Iterative signal recovery from incomplete and inaccurate samples, Appl. Comp. Harmonic Anal, vol.26, issue.3, pp.301-321, 2009.

. Nguyen, An optimized version of non-negative omp, GRETSI. (Cited on pages xii, vol.12, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01585253

. Nguyen, , 2019.

, Non-negative orthogonal greedy algorithms, vol.2

. Nguyen, , 2019.

, Non-negative greedy algorithms: Matlab implementation, vol.32

. Nguyen, NP-hardness of 0 minimization problems: revision and extension to the non-negative setting, 13th International Conference on Sampling Theory and Applications, p.83, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02112180

. Nguyen, Sign preservation analysis of orthogonal greedy algorithms, vol.63, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01971697

M. Nikolova, Description of the minimizers of least squares regularized with 0 norm. Uniqueness of the global minimizer, SIAM J. Imaging Sci, vol.6, issue.2, p.86, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00723812

W. ;. Nocedal, J. Nocedal, and S. J. Wright, Numerical optimization. Springer texts in Operations Research and Financial Engineering, 2006.

[. Pati, Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition, Proc. 27th Asilomar Conf. on Signals, Systems and Computers, vol.1, pp.40-44, 1993.

R. Peharz and F. Pernkopf, Sparse nonnegative matrix factorization with l0 constraints, Neurocomputing, vol.80, pp.38-46, 2012.

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

M. D. Plumbley, On polar polytopes and the recovery of sparse representations, IEEE Trans. Inf. Theory, vol.53, issue.9, p.68, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00839327

[. Ramamurthy, Recovering non-negative and combined sparse representations, Digital Signal Process, vol.26, issue.1, pp.21-35, 2014.

. Rapin, Sparse and nonnegative BSS for noisy data, IEEE Trans. Signal Process, vol.61, issue.22, pp.5620-5632, 2013.
URL : https://hal.archives-ouvertes.fr/cea-01816377

. Rebollo-neira, L. Lowe-;-rebollo-neira, and D. Lowe, Optimized orthogonal matching pursuit approach, IEEE Signal Process. Lett, vol.9, issue.4, p.66, 2002.

[. Saab, Stable sparse approximations via nonconvex optimization, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, p.14, 2008.

[. Satpathi, Improving the bound on the RIP constant in generalized orthogonal matching pursuit, IEEE Signal Process. Lett, vol.20, issue.11, pp.1074-1077, 2013.

[. Slawski, M. Hein-;-slawski, and M. Hein, Sparse recovery by thresholded nonnegative least squares, Adv. Neural Inf. Process. Syst, vol.24, pp.1926-1934, 2011.

[. Slawski, M. Hein-;-slawski, and M. Hein, Non-negative least squares for highdimensional linear models: Consistency and sparse recovery without regularization, Electron. J. Stat, vol.7, pp.3004-3056, 2013.

[. Slawski, Isotope pattern deconvolution for peptide mass spectrometry by non-negative least squares/least absolute deviation template matching, BMC Bioinformatics, vol.13, issue.291, pp.1-18, 2012.

. Soubies, A continuous exact l0 penalty (cel0) for least squares regularized problem, SIAM J. Imaging Sci, vol.8, issue.3, pp.1607-1639, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01102492

. Soussen, Joint kstep analysis of orthogonal matching pursuit and orthogonal least squares, IEEE Trans. Inf. Theory, vol.59, issue.5, pp.3158-3174, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00637003

. Soussen, From Bernoulli-Gaussian deconvolution to sparse signal restoration, IEEE Trans. Signal Process, vol.59, issue.10, pp.4572-4584, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00443842

. Soussen, Homotopy based algorithms for 0 -regularized least-squares, IEEE Transactions on Signal Processing, vol.63, issue.13, pp.3301-3316, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00948313

C. Sturm, B. L. Sturm, and M. G. Christensen, Comparison of orthogonal matching pursuit implementations, Proc. Eur. Sig. Proc. Conf, pp.220-224, 2012.

N. Thoai, A modified version of tuy's method for solving d.c. programing problem. Optimization, vol.19, p.14, 1988.

R. Tibshirani, Regression shrinkage and selection via the Lasso, J. R. Statist. Soc. B, vol.58, issue.1, pp.267-288, 1996.

A. M. Tillmann, On the computational intractability of exact and approximate dictionary learning, IEEE Signal Processing Letters, vol.22, issue.1, p.15, 2015.

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

[. Turlach, Simultaneous variable selection, Technometrics, vol.47, issue.3, p.42, 2005.

E. Van-den-berg and M. Friedlander, Probing the pareto frontier for basis pursuit solutions, SIAM Journal on Scientific Computing, vol.31, issue.2, p.13, 2009.

[. Virtanen, 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.

[. Wagner, Analysis of selected properties of fibreboard panels manufactured from wood and leather using the near infrared spectroscopy, Int J. Spectrosc, p.42, 2015.

L. Wang, J. Wang, and P. Li, Recovery of sparse signals using multiple orthogonal least squares, IEEE Trans. Signal Process, vol.65, issue.8, pp.2049-2062, 2017.

[. Wang, Cone-based joint sparse modelling for hyperspectral image classification, Signal Processing, vol.144, pp.417-429, 2018.

[. Wen, Nearly optimal bounds for orthogonal least squares, IEEE Trans. Signal Process, vol.65, issue.20, pp.5347-5356, 2017.

[. Wen, A sharp condition for exact support recovery with orthogonal matching pursuit, IEEE Trans. Signal Process, vol.65, issue.6, pp.1370-1382, 2017.

[. Wen, A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation, SIAM Journal on Scientific Computing, vol.32, issue.4, p.92, 2010.

M. H. Wright, Interior methods for constrained optimization, Acta Numerica, vol.1, pp.341-407, 1992.

[. Yaghoobi, M. Davies-;-yaghoobi, and M. E. Davies, Fast non-negative orthogonal least squares, Proc. Eur. Sig. Proc. Conf., pages, vol.64, pp.479-483, 2015.

[. Yaghoobi, Fast non-negative orthogonal matching pursuit, IEEE Signal Process. Lett, vol.22, issue.9, pp.1229-1233, 2015.

T. Zhang, Sparse recovery with orthogonal matching pursuit under RIP, IEEE Trans. Inf. Theory, vol.57, issue.9, p.28, 2011.

L. ;. Zou, H. Zou, and R. Li, One-step sparse estimates in nonconcave penalized likelihood models, The Annals of Statistics, vol.36, issue.4, p.14, 2008.