{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T11:59:06Z","timestamp":1764331146458,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2022,11,15]],"date-time":"2022-11-15T00:00:00Z","timestamp":1668470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,15]],"date-time":"2022-11-15T00:00:00Z","timestamp":1668470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["Starting grant 679515"],"award-info":[{"award-number":["Starting grant 679515"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002661","name":"Fonds De La Recherche Scientifique - FNRS","doi-asserted-by":"publisher","award":["EOS project O005318F-RG47"],"award-info":[{"award-number":["EOS project O005318F-RG47"]}],"id":[{"id":"10.13039\/501100002661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["EOS project O005318F-RG47"],"award-info":[{"award-number":["EOS project O005318F-RG47"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-20-CE23-0010"],"award-info":[{"award-number":["ANR-20-CE23-0010"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10994-022-06260-2","type":"journal-article","created":{"date-parts":[[2022,11,15]],"date-time":"2022-11-15T19:06:49Z","timestamp":1668539209000},"page":"4453-4495","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Matrix-wise $$\\ell _0$$-constrained sparse nonnegative least squares"],"prefix":"10.1007","volume":"111","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5993-7194","authenticated-orcid":false,"given":"Nicolas","family":"Nadisic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeremy E.","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Vandaele","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Gillis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,15]]},"reference":[{"key":"6260_CR1","doi-asserted-by":"crossref","unstructured":"Aharon, M., Elad, M., & Bruckstein, A. M. (2005). K-SVD and its non-negative variant for dictionary design. In Wavelets XI, Int. Soc. for Optics and Photonics.","DOI":"10.1117\/12.613878"},{"key":"6260_CR2","doi-asserted-by":"crossref","unstructured":"Ben Mhenni, R., Bourguignon, S., & Ninin, J. (2021). Global optimization for sparse solution of least squares problems. Optimization Methods and Software, 1\u201330.","DOI":"10.1080\/10556788.2021.1977809"},{"issue":"2","key":"6260_CR3","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1109\/JSTARS.2012.2194696","volume":"5","author":"JM Bioucas-Dias","year":"2012","unstructured":"Bioucas-Dias, J. M., Plaza, A., Dobigeon, N., Parente, M., Du, Q., Gader, P., & Chanussot, J. (2012). Hyperspectral unmixing overview: Geometrical, statistical, and sparse regression-based approaches. IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 5(2), 354\u2013379.","journal-title":"IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing"},{"issue":"3","key":"6260_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.acha.2009.04.002","volume":"27","author":"T Blumensath","year":"2009","unstructured":"Blumensath, T., & Davies, M. E. (2009). Iterative hard thresholding for compressed sensing. Applied and computational harmonic analysis, 27(3), 265\u2013274.","journal-title":"Applied and computational harmonic analysis"},{"issue":"11","key":"6260_CR5","doi-asserted-by":"publisher","first-page":"4813","DOI":"10.1109\/TIT.2008.929920","volume":"54","author":"AM Bruckstein","year":"2008","unstructured":"Bruckstein, A. M., Elad, M., & Zibulevsky, M. (2008). On the uniqueness of nonnegative sparse solutions to underdetermined systems of equations. IEEE Transactions on Information Theory, 54(11), 4813\u20134820.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"6260_CR6","doi-asserted-by":"publisher","first-page":"1873","DOI":"10.1080\/00207178908953472","volume":"50","author":"S Chen","year":"1989","unstructured":"Chen, S., Billings, S. A., & Luo, W. (1989). Orthogonal least squares methods and their application to non-linear system identification. International Journal of control, 50(5), 1873\u20131896.","journal-title":"International Journal of control"},{"key":"6260_CR7","doi-asserted-by":"crossref","unstructured":"Cichocki, A., Phan, A.H., & Caiafa, C. (2008). Flexible HALS algorithms for sparse non-negative matrix\/tensor factorization. In IEEE workshop on machine learning for signal processing, (pp. 73\u201378).","DOI":"10.1109\/MLSP.2008.4685458"},{"key":"6260_CR8","doi-asserted-by":"crossref","unstructured":"Cohen, J.E., & Gillis, N. (2019). Nonnegative low-rank sparse component analysis. In 2019 IEEE international conference on acoustics, speech and signal processing, (pp. 8226\u20138230).","DOI":"10.1109\/ICASSP.2019.8682188"},{"issue":"11","key":"6260_CR9","doi-asserted-by":"publisher","first-page":"4789","DOI":"10.1109\/TIT.2008.929958","volume":"54","author":"DL Donoho","year":"2008","unstructured":"Donoho, D. L., & Tsaig, Y. (2008). Fast solution of $$\\ell _1$$-norm minimization problems when the solution may be sparse. IEEE Transactions on Information theory, 54(11), 4789\u20134812.","journal-title":"IEEE Transactions on Information theory"},{"issue":"2","key":"6260_CR10","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1214\/009053604000000067","volume":"32","author":"B Efron","year":"2004","unstructured":"Efron, B., Hastie, T., Johnstone, I., Tibshirani, R., et al. (2004). Least angle regression. The Annals of statistics, 32(2), 407\u2013499.","journal-title":"The Annals of statistics"},{"key":"6260_CR11","first-page":"2529","volume":"4","author":"J Eggert","year":"2004","unstructured":"Eggert, J., & Korner, E. (2004). Sparse coding and NMF. IEEE International Joint Conference on Neural Networks, 4, 2529\u20132533.","journal-title":"IEEE International Joint Conference on Neural Networks"},{"issue":"4","key":"6260_CR12","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1109\/LSP.2014.2307064","volume":"21","author":"S Foucart","year":"2014","unstructured":"Foucart, S., & Koslicki, D. (2014). Sparse recovery by means of nonnegative least squares. IEEE Signal Processing Letters, 21(4), 498\u2013502.","journal-title":"IEEE Signal Processing Letters"},{"key":"6260_CR13","first-page":"3349","volume":"13","author":"N Gillis","year":"2012","unstructured":"Gillis, N. (2012). Sparse and unique nonnegative matrix factorization through data preprocessing. Journal of Machine Learning Research, 13, 3349\u20133386.","journal-title":"Journal of Machine Learning Research"},{"issue":"2","key":"6260_CR14","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1137\/130946782","volume":"7","author":"N Gillis","year":"2014","unstructured":"Gillis, N. (2014). Successive nonnegative projection algorithm for robust nonnegative blind source separation. SIAM Journal on Imaging Sciences, 7(2), 1420\u20131450.","journal-title":"SIAM Journal on Imaging Sciences"},{"key":"6260_CR15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976410","volume-title":"Nonnegative matrix factorization","author":"N Gillis","year":"2020","unstructured":"Gillis, N. (2020). Nonnegative matrix factorization. SIAM."},{"key":"6260_CR16","doi-asserted-by":"crossref","unstructured":"Hoyer, P. O. (2002). Non-negative sparse coding. In IEEE workshop on neural networks for signal processing, (pp 557\u2013565).","DOI":"10.1109\/NNSP.2002.1030067"},{"key":"6260_CR17","first-page":"1457","volume":"5","author":"PO Hoyer","year":"2004","unstructured":"Hoyer, P. O. (2004). Non-negative matrix factorization with sparseness constraints. Journal of machine learning research, 5, 1457\u20131469.","journal-title":"Journal of machine learning research"},{"issue":"1","key":"6260_CR18","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/TSP.2016.2613067","volume":"65","author":"Y Itoh","year":"2017","unstructured":"Itoh, Y., Duarte, M. F., & Parente, M. (2017). Perfect recovery conditions for non-negative sparse modeling. IEEE Transactions on Signal Processing, 65(1), 69\u201380.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"12","key":"6260_CR19","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1093\/bioinformatics\/btm134","volume":"23","author":"H Kim","year":"2007","unstructured":"Kim, H., & Park, H. (2007). Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares for microarray data analysis. Bioinformatics, 23(12), 1495\u20131502.","journal-title":"Bioinformatics"},{"key":"6260_CR20","doi-asserted-by":"crossref","unstructured":"Kim, J., Ramakrishnan, N., Marwah, M., Shah, A., & Park, H. (2013). Regularization paths for sparse nonnegative least squares problems with applications to life cycle assessment tree discovery. In IEEE 13th international conference on data mining, (pp. 360\u2013369).","DOI":"10.1109\/ICDM.2013.125"},{"key":"6260_CR21","doi-asserted-by":"crossref","unstructured":"Lawson, C.L., & Hanson, R.J. (1995). Solving least squares problems. Society for Industrial and Applied Mathematics.","DOI":"10.1137\/1.9781611971217"},{"key":"6260_CR22","unstructured":"Lee, D. D., & Seung, H. S. (1997). Unsupervised learning by convex and conic coding. In Advances in neural information processing systems, (pp. 515\u2013521)."},{"issue":"6755","key":"6260_CR23","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"DD Lee","year":"1999","unstructured":"Lee, D. D., & Seung, H. S. (1999). Learning the parts of objects by non-negative matrix factorization. Nature, 401(6755), 788\u2013791.","journal-title":"Nature"},{"issue":"1","key":"6260_CR24","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/MSP.2013.2279731","volume":"31","author":"WK Ma","year":"2013","unstructured":"Ma, W. K., Bioucas-Dias, J. M., Chan, T. H., Gillis, N., Gader, P., Plaza, A. J., Ambikapathi, A., & Chi, C. Y. (2013). A signal processing perspective on hyperspectral unmixing: Insights from remote sensing. IEEE Signal Processing Magazine, 31(1), 67\u201381.","journal-title":"IEEE Signal Processing Magazine"},{"key":"6260_CR25","doi-asserted-by":"crossref","unstructured":"Mohimani, G. H., Babaie-Zadeh, M., & Jutten, C. (2007). Fast sparse representation based on smoothed $$\\ell _0$$ norm. In International conference on independent component analysis and signal separation (pp. 389\u2013396). Springer.","DOI":"10.1007\/978-3-540-74494-8_49"},{"key":"6260_CR26","doi-asserted-by":"crossref","unstructured":"Morup, M., Madsen, K. H., & Hansen, L. K. (2008). Approximate L0 constrained non-negative matrix and tensor factorization. In 2008 IEEE international symposium on circuits and systems (pp. 1328\u20131331). IEEE.","DOI":"10.1109\/ISCAS.2008.4541671"},{"key":"6260_CR27","doi-asserted-by":"crossref","unstructured":"Nadisic, N., Vandaele, A., Gillis, N., & Cohen, J. E. (2020). Exact sparse nonnegative least squares. In 2020 IEEE international conference on acoustics, speech and signal processing (pp. 5395\u20135399).","DOI":"10.1109\/ICASSP40776.2020.9053295"},{"key":"6260_CR28","doi-asserted-by":"crossref","unstructured":"Nadisic, N., Vandaele, A., Gillis, N., & Cohen, J. E. (2021). Exact biobjective k-sparse nonnegative least squares. In EUSIPCO 2021-29th European signal processing conference (pp. 2079\u20132083).","DOI":"10.23919\/EUSIPCO54536.2021.9616202"},{"issue":"21","key":"6260_CR29","doi-asserted-by":"publisher","first-page":"5643","DOI":"10.1109\/TSP.2019.2943225","volume":"67","author":"TT Nguyen","year":"2019","unstructured":"Nguyen, T. T., Idier, J., Soussen, C., & Djermoune, E. H. (2019). Non-negative orthogonal greedy algorithms. IEEE Transactions on Signal Processing, 67(21), 5643\u20135658.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"3","key":"6260_CR30","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1093\/imanum\/20.3.389","volume":"20","author":"MR Osborne","year":"2000","unstructured":"Osborne, M. R., Presnell, B., & Turlach, B. A. (2000). A new approach to variable selection in least squares problems. IMA Journal of Numerical Analysis, 20(3), 389\u2013403.","journal-title":"IMA Journal of Numerical Analysis"},{"key":"6260_CR31","doi-asserted-by":"crossref","unstructured":"Pati, Y. C., Rezaiifar, R., & Krishnaprasad, P. S. (1993). Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition. In Proceedings of 27th Asilomar conference on signals, systems and computers (pp. 40\u201344).","DOI":"10.1109\/ACSSC.1993.342465"},{"key":"6260_CR32","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.neucom.2011.09.024","volume":"80","author":"R Peharz","year":"2012","unstructured":"Peharz, R., & Pernkopf, F. (2012). Sparse nonnegative matrix factorization with $$\\ell _0$$-constraints. Neurocomputing, 80, 38\u201346.","journal-title":"Neurocomputing"},{"issue":"208","key":"6260_CR33","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1090\/S0025-5718-1994-1250776-4","volume":"63","author":"LF Portugal","year":"1994","unstructured":"Portugal, L. F., Judice, J. J., & Vicente, L. N. (1994). A comparison of block pivoting and interior-point algorithms for linear least squares problems with nonnegative variables. Mathematics of Computation, 63(208), 625\u2013643.","journal-title":"Mathematics of Computation"},{"issue":"5","key":"6260_CR34","doi-asserted-by":"publisher","first-page":"3158","DOI":"10.1109\/TIT.2013.2238606","volume":"59","author":"C Soussen","year":"2013","unstructured":"Soussen, C., Gribonval, R., Idier, J., & Herzet, C. (2013). Joint $$k$$-step analysis of orthogonal matching pursuit and orthogonal least squares. IEEE Transactions on Information Theory, 59(5), 3158\u20133174.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"8","key":"6260_CR35","doi-asserted-by":"publisher","first-page":"3075","DOI":"10.1109\/TSP.2009.2020754","volume":"57","author":"M Stojnic","year":"2009","unstructured":"Stojnic, M., Parvaresh, F., & Hassibi, B. (2009). On the reconstruction of block-sparse signals with an optimal number of measurements. IEEE Transactions on Signal Processing, 57(8), 3075\u20133085.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"1","key":"6260_CR36","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R. (1996). Regression shrinkage and selection via the Lasso. Journal of the Royal Statistical Society: Series B (Methodological), 58(1), 267\u2013288.","journal-title":"Journal of the Royal Statistical Society: Series B (Methodological)"},{"issue":"10","key":"6260_CR37","doi-asserted-by":"publisher","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","volume":"50","author":"JA Tropp","year":"2004","unstructured":"Tropp, J. A. (2004). Greed is good: Algorithmic results for sparse approximation. IEEE Transactions on Information theory, 50(10), 2231\u20132242.","journal-title":"IEEE Transactions on Information theory"},{"issue":"3","key":"6260_CR38","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1109\/TIT.2005.864420","volume":"52","author":"JA Tropp","year":"2006","unstructured":"Tropp, J. A. (2006). Just relax: Convex programming methods for identifying sparse signals in noise. IEEE Transactions on Information Theory, 52(3), 1030\u20131051.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"6260_CR39","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1016\/j.sigpro.2005.05.030","volume":"86","author":"JA Tropp","year":"2006","unstructured":"Tropp, J. A., Gilbert, A. C., & Strauss, M. J. (2006). Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit. Signal processing, 86(3), 572\u2013588.","journal-title":"Signal processing"},{"issue":"9","key":"6260_CR40","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1109\/LSP.2015.2393637","volume":"22","author":"M Yaghoobi","year":"2015","unstructured":"Yaghoobi, M., Wu, D., & Davies, M. E. (2015). Fast non-negative orthogonal matching pursuit. IEEE Signal Processing Letters, 22(9), 1229\u20131233.","journal-title":"IEEE Signal Processing Letters"},{"key":"6260_CR41","unstructured":"Zhu, F. (2017). Hyperspectral unmixing: Ground truth labeling, datasets, benchmark performances and survey. Preprint arXiv:1708.05125."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-022-06260-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-022-06260-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-022-06260-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,8]],"date-time":"2024-10-08T07:39:11Z","timestamp":1728373151000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-022-06260-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,15]]},"references-count":41,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["6260"],"URL":"https:\/\/doi.org\/10.1007\/s10994-022-06260-2","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2022,11,15]]},"assertion":[{"value":"15 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest or competing interest to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}