{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:29:05Z","timestamp":1750220945807,"version":"3.41.0"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,4,24]],"date-time":"2017-04-24T00:00:00Z","timestamp":1492992000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,4,24]],"date-time":"2017-04-24T00:00:00Z","timestamp":1492992000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["1115950","1418724"],"award-info":[{"award-number":["1115950","1418724"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11571061"],"award-info":[{"award-number":["11571061"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s10589-017-9913-x","type":"journal-article","created":{"date-parts":[[2017,4,24]],"date-time":"2017-04-24T12:07:48Z","timestamp":1493035668000},"page":"333-362","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["An alternating direction and projection algorithm for structure-enforced matrix factorization"],"prefix":"10.1007","volume":"68","author":[{"given":"Lijun","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,24]]},"reference":[{"issue":"2","key":"9913_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/env.3170050203","volume":"5","author":"P Paatero","year":"1994","unstructured":"Paatero, P., Tapper, U.: Positive matrix factorization: a non-negative factor model with optimal utilization of error estimates of data values. Environmetrics 5(2), 111\u2013126 (1994)","journal-title":"Environmetrics"},{"key":"9913_CR2","unstructured":"Lee, D.D., Seung, H.S.: Algorithms for non-negative matrix factorization. In: Conference on Neural Information Processing Systems (NIPS), pp. 556\u2013562. MIT Press, MIT (2001)"},{"key":"9913_CR3","unstructured":"Gonzalez, E., Zhang, Y.: Accelerating the lee-seung algorithm for nonnegative matrix factorization. Technical Report TR05-02, CAAM, Rice University (2005)"},{"issue":"6","key":"9913_CR4","doi-asserted-by":"publisher","first-page":"1589","DOI":"10.1109\/TNN.2007.895831","volume":"18","author":"CJ Lin","year":"2007","unstructured":"Lin, C.J.: On the convergence of multiplicative update algorithms for nonnegative matrix factorization. IEEE Trans. Neural Netw. 18(6), 1589\u20131596 (2007)","journal-title":"IEEE Trans. Neural Netw."},{"key":"9913_CR5","unstructured":"Albright, R., Cox, J., Duling, D., Langville, A.N., Meyer, C.D.: Algorithms, initializations, and convergence for the nonnegative matrix factorization. NCSU Technical Report, Math 81706 (2006)"},{"issue":"10","key":"9913_CR6","doi-asserted-by":"publisher","first-page":"2756","DOI":"10.1162\/neco.2007.19.10.2756","volume":"19","author":"CJ Lin","year":"2007","unstructured":"Lin, C.J.: Projected gradient methods for non-negative matrix factorization. Neural Comput. 19(10), 2756\u20132779 (2007)","journal-title":"Neural Comput."},{"key":"9913_CR7","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.: Learning the parts of objects by non-negative matrix factorization. Nature 401, 788\u2013791 (1999)","journal-title":"Nature"},{"key":"9913_CR8","doi-asserted-by":"crossref","unstructured":"Hoyer, P.O.: Non-negative sparse coding. Neural Networks for Signal Processing XII (Proc. IEEE Workshop on Neural Networks for Signal Processing), pp. 557\u2013565. Martigny, Switzerland (2002)","DOI":"10.1109\/NNSP.2002.1030067"},{"key":"9913_CR9","unstructured":"Feng, T., Li, S.Z., Shum, H.Y., Zhang, H.J.: Local non-negative matrix factorization as a visual representation. In: Proceedings of the 2nd International Conference on Development and Learning, pp. 178\u2013183 (2002)"},{"key":"9913_CR10","first-page":"1457","volume":"5","author":"PO Hoyer","year":"2004","unstructured":"Hoyer, P.O., Dayan, P.: Non-negative matrix factorization with sparseness constraints. J. Mach. Learn. Res. 5, 1457\u20131469 (2004)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"9913_CR11","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1109\/TPAMI.2006.60","volume":"28","author":"AP Montano","year":"2006","unstructured":"Montano, A.P., Carazo, J.M., Kochi, K., Lehmann, D., Pascual-Marqui, R.D.: Nonsmooth nonnegative matrix factorization (nsnmf). IEEE Trans. Pattern Anal. 28(3), 403\u2013415 (2006)","journal-title":"IEEE Trans. Pattern Anal."},{"key":"9913_CR12","unstructured":"Jenatton, R., Obozinski, G., Bach, F.: Structured sparse principal component analysis. International Conference on Artificial Intellgence and Statistics (AISTATS) (2010)"},{"key":"9913_CR13","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.: Sparse nonnegative matrix factorization with $$\\ell _0$$-constraints. Neurocomputing 80, 38\u201346 (2012)","journal-title":"Neurocomputing"},{"issue":"8","key":"9913_CR14","doi-asserted-by":"publisher","first-page":"2912","DOI":"10.1016\/j.patcog.2012.01.022","volume":"45","author":"WS Zheng","year":"2012","unstructured":"Zheng, W.S., Lai, J.H., Liao, S.C., He, R.: Extracting non-negative basis images using pixel dispersion penalty. Pattern Recogn. 45(8), 2912\u20132926 (2012)","journal-title":"Pattern Recogn."},{"issue":"11","key":"9913_CR15","doi-asserted-by":"publisher","first-page":"4311","DOI":"10.1109\/TSP.2006.881199","volume":"54","author":"M Aharon","year":"2006","unstructured":"Aharon, M., Elad, M., Bruckstein, A.: K-svd: an algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans. Signal Process. 54(11), 4311\u20134322 (2006)","journal-title":"IEEE Trans. Signal Process."},{"key":"9913_CR16","doi-asserted-by":"crossref","unstructured":"Mairal, J., Bach, F., Ponce, J., Sapiro, G.: Online dictionary learning for sparse coding. In: Proceedings of the 26th Annual International Conference on Machine Learning 8, pp. 689\u2013696 (2009)","DOI":"10.1145\/1553374.1553463"},{"key":"9913_CR17","first-page":"2777","volume":"12","author":"R Jenatton","year":"2011","unstructured":"Jenatton, R., Audibert, J.Y., Bach, F.: Structured variable selection with sparsity-inducing norms. J. Mach. Learn. Res. 12, 2777\u20132824 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"9913_CR18","doi-asserted-by":"crossref","unstructured":"Szabo, Z., Poczos, B., Lorincz, A.: Online group-structured dictionary learning. In: Proceedings of the 24th IEEE Conference on Computer Vision and Pattern Recognition (CVPR) 11, pp. 2865\u20132872, Washington, DC (2011)","DOI":"10.1109\/CVPR.2011.5995712"},{"issue":"2","key":"9913_CR19","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1051\/m2an\/197509R200411","volume":"9","author":"R Glowinski","year":"1975","unstructured":"Glowinski, R., Marroco, A.: Sur lapproximation, par elements finis dordre un, et la resolution, par penalisation-dualite dune classe de problemes de dirichlet non lineaires. Revue francaise dautomatique, informatique, recherche operationnelle. Analyse numerique 9(2), 41\u201376 (1975)","journal-title":"Revue francaise dautomatique, informatique, recherche operationnelle. Analyse numerique"},{"issue":"1","key":"9913_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Comput. Math. Appl. 2(1), 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"issue":"1","key":"9913_CR21","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1137\/090777761","volume":"33","author":"J Yang","year":"2011","unstructured":"Yang, J., Zhang, Y.: Alternating direction algorithms for L1-problems in compressive sensing. SIAM J. Sci. Comput. 33(1), 250\u2013278 (2011)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"9913_CR22","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/080725891","volume":"2","author":"T Goldstein","year":"2009","unstructured":"Goldstein, T., Osher, S.: The split Bregman method for L1 regularized problems. SIAM J. Imaging Sci. 2(2), 323\u2013343 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"9913_CR23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970838","volume-title":"Augmented Lagrangian and Operator Splitting Methods in Nonlinear Mechanics","author":"R Glowinski","year":"1989","unstructured":"Glowinski, R., Le Tallec, P.: Augmented Lagrangian and Operator Splitting Methods in Nonlinear Mechanics. SIAM, Philadelphia (1989)"},{"issue":"92","key":"9913_CR24","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s101070100280","volume":"A","author":"B He","year":"2002","unstructured":"He, B., Liao, L., Han, D., Yang, H.: A new inexact alternating directions method for monotone variational inequalities. Math. Program. A(92), 103\u2013118 (2002)","journal-title":"Math. Program."},{"key":"9913_CR25","doi-asserted-by":"crossref","unstructured":"Deng, W., Yin, W.: On the global and linear convergence of the generalized alternating direction method of multipliers. Technical Report TR12-14, CAAM, Rice University (2012)","DOI":"10.21236\/ADA567407"},{"key":"9913_CR26","volume-title":"A Method for Nonlinear Constraints in Minimization Problems. Optimization","author":"MJD Powell","year":"1969","unstructured":"Powell, M.J.D.: A Method for Nonlinear Constraints in Minimization Problems. Optimization. Academic Press, London (1969)"},{"key":"9913_CR27","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF00927673","volume":"4","author":"MR Hestenes","year":"1969","unstructured":"Hestenes, M.R.: Multiplier and gradient methods. J. Optimiz. Theory Appl. 4, 303\u2013320 (1969)","journal-title":"J. Optimiz. Theory Appl."},{"key":"9913_CR28","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/BF00934777","volume":"12","author":"RT Rockafellar","year":"1973","unstructured":"Rockafellar, R.T.: The multiplier method of hestenes and powell applied to convex programming. J. Optimiz. Theory Appl. 12, 555\u2013562 (1973)","journal-title":"J. Optimiz. Theory Appl."},{"key":"9913_CR29","volume-title":"Augmented Lagrangian Methods","author":"M Fortin","year":"1983","unstructured":"Fortin, M., Glowinski, R.: Augmented Lagrangian Methods. North-Holland, Amsterdam (1983)"},{"key":"9913_CR30","unstructured":"Zhang, Y.: An alternating direction algorithm for nonnegative matrix factorization. Technical Report TR10-03, CAAM, Rice University (2010)"},{"issue":"2","key":"9913_CR31","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1023\/A:1004603514434","volume":"106","author":"BS He","year":"2000","unstructured":"He, B.S., Yang, H., Wang, S.L.: Alternating direction method with self adaptive penalty parameters for monotone variational inequalities. J. Optimiz. Theory Appl. 106(2), 337\u2013356 (2000)","journal-title":"J. Optimiz. Theory Appl."},{"key":"9913_CR32","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s12532-010-0017-1","volume":"2","author":"Z Wen","year":"2010","unstructured":"Wen, Z., Goldfarb, D., Yin, W.: Alternating direction augmented Lagrangian methods for semidefinite programming. Math. Progam. Comput. 2, 203\u2013230 (2010)","journal-title":"Math. Progam. Comput."},{"key":"9913_CR33","unstructured":"Lin, Z., Liu, R., Su, Z.: Linearized alternating direction method with adaptive penalty for low rank representation. Advances in Neural Information Processing Systems(NIPS) 24 (2011)"},{"key":"9913_CR34","doi-asserted-by":"crossref","unstructured":"Samaria, F.S., Harter, A.C.: Parameterisation of a stochastic model for human face identification. In: Proceedings of the 2nd IEEE Workshop on Applications of Computer Vision, pp. 138\u2013142 (1994)","DOI":"10.1109\/ACV.1994.341300"},{"key":"9913_CR35","unstructured":"Donoho, D., Stodden, V.: When does non-negative matrix factorization give a correct decomposition into Parts? In: Proceedings of 17th Annual Conferance Neural Information Processing Systems NIPS (2003)"},{"key":"9913_CR36","doi-asserted-by":"publisher","first-page":"3397","DOI":"10.1109\/78.258082","volume":"41","author":"S Mallat","year":"1993","unstructured":"Mallat, S., Zhang, Z.F.: Matching pursuit with time-frequency dictionaries. IEEE Trans. Signal Process. 41, 3397\u20133415 (1993)","journal-title":"IEEE Trans. Signal Process."},{"key":"9913_CR37","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.: Orthogonal least squares methods and their application to non-linear system identification. Int. J. Control 50, 1873\u20131896 (1989)","journal-title":"Int. J. Control"},{"issue":"7","key":"9913_CR38","doi-asserted-by":"publisher","first-page":"2183","DOI":"10.1117\/12.173207","volume":"33","author":"GM Davis","year":"1994","unstructured":"Davis, G.M., Mallat, S.G., Zhang, Z.F.: Adaptive time-frequency decompositions. Opt. Eng. 33(7), 2183\u20132191 (1994)","journal-title":"Opt. Eng."},{"key":"9913_CR39","unstructured":"Pati, Y.C., Rezaiifar, R., Krishnaprasad, P.S.: Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition. In: 1993 Conference Record of The Twenty-Seventh Asilomar Conference on Signals, Systems and Computers 1, pp. 40\u201344 (1993)"},{"issue":"10","key":"9913_CR40","doi-asserted-by":"publisher","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","volume":"50","author":"JA Tropp","year":"2004","unstructured":"Tropp, J.A.: Greed is good: algorithmic results for sparse approximation. IEEE Trans. Inf. Theory 50(10), 2231\u20132242 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9913_CR41","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"S Chen","year":"1998","unstructured":"Chen, S., Donoho, D., Saunders, M.: Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20, 33\u201361 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"9913_CR42","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1109\/78.558475","volume":"45","author":"IF Gorodnitsky","year":"1997","unstructured":"Gorodnitsky, I.F., Rao, B.D.: Sparse signal reconstruction from limited data using focuss: A re-weighted norm minimization algorithm. IEEE Trans. Signal Process. 45, 600\u2013616 (1997)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"9913_CR43","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1109\/78.738251","volume":"47","author":"BD Rao","year":"1999","unstructured":"Rao, B.D., Kreutz-Delgado, K.: An affine scaling methodology for best basis selection. IEEE Trans. Signal Process. 47(1), 187\u2013200 (1999)","journal-title":"IEEE Trans. Signal Process."},{"key":"9913_CR44","doi-asserted-by":"crossref","unstructured":"Rao, B.D., Kreutz-Delgado, K.: Deriving algorithms for computing sparse solutions to linear inverse problems. In: IEEE Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers 1, pp. 955\u2013959 (1998)","DOI":"10.1109\/ACSSC.1997.680585"},{"issue":"3","key":"9913_CR45","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1109\/TSP.2002.808076","volume":"51","author":"BD Rao","year":"2003","unstructured":"Rao, B.D., Engan, K., Cotter, S.F., Palmer, J., Kreutz-Delgado, K.: Subset selection in noise based on diversity measure minimization. IEEE Trans. Signal Process. 51(3), 760\u2013770 (2003)","journal-title":"IEEE Trans. Signal Process."},{"key":"9913_CR46","volume-title":"Vector Quantization and Signal Compression","author":"A Gersho","year":"1991","unstructured":"Gersho, A., Gray, R.M.: Vector Quantization and Signal Compression. Kluwer Academic Publishers, Norwell (1991)"},{"issue":"7","key":"9913_CR47","doi-asserted-by":"publisher","first-page":"1587","DOI":"10.1364\/JOSAA.16.001587","volume":"16","author":"MS Lewicki","year":"1999","unstructured":"Lewicki, M.S., Olshausen, B.A.: A probabilistic framework for the adaptation and comparison of image codes. J. Opt. Soc. Am. A Opt. Image Sci. Vis. 16(7), 1587\u20131601 (1999)","journal-title":"J. Opt. Soc. Am. A Opt. Image Sci. Vis."},{"issue":"2","key":"9913_CR48","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1088\/0954-898X_7_2_014","volume":"7","author":"BA Olshausen","year":"1996","unstructured":"Olshausen, B.A., Field, D.J.: Natural image statistics and efficient coding. Netw. Comput. Neural 7(2), 333\u2013339 (1996)","journal-title":"Netw. Comput. Neural"},{"key":"9913_CR49","doi-asserted-by":"publisher","first-page":"3311","DOI":"10.1016\/S0042-6989(97)00169-7","volume":"37","author":"BA Olshausen","year":"1997","unstructured":"Olshausen, B.A., Field, B.J.: Sparse coding with an overcomplete basis set: a strategy employed by v1? Vis. Res. 37, 3311\u20133325 (1997)","journal-title":"Vis. Res."},{"key":"9913_CR50","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1162\/089976600300015826","volume":"12","author":"MS Lewicki","year":"2000","unstructured":"Lewicki, M.S., Sejnowski, T.J.: Learning overcomplete representations. Neural Comput. 12, 337\u2013365 (2000)","journal-title":"Neural Comput."},{"issue":"10","key":"9913_CR51","doi-asserted-by":"publisher","first-page":"2121","DOI":"10.1016\/S0165-1684(00)00072-4","volume":"80","author":"K Engan","year":"2000","unstructured":"Engan, K., Aase, S.O., Hus\u00f8y, J.H.: Multi-frame compression: theory and design. EURASIP Signal Process. 80(10), 2121\u20132140 (2000)","journal-title":"EURASIP Signal Process."},{"key":"9913_CR52","doi-asserted-by":"crossref","unstructured":"Engan, K., Aase, S.O., Hakon-Husoy, J.H.: Method of optimal directions for frame design. In: IEEE International Conferance on Acoustics, Speech, and Signal Processing 5, pp. 2443\u20132446 (1999)","DOI":"10.1109\/ICASSP.1999.760624"},{"key":"9913_CR53","unstructured":"Engan, K., Rao, B.D., Kreutz-Delgado, K.: Frame design using focuss with method of optimal directions (MOD). Norwegian Signal Processing Symposium, pp. 65\u201369 (1999)"},{"issue":"2","key":"9913_CR54","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1162\/089976603762552951","volume":"15","author":"K Kreutz-Delgado","year":"2003","unstructured":"Kreutz-Delgado, K., Murray, J.F., Rao, B.D., Engan, K., Lee, T., Sejnowski, T.J.: Dictionary learning algorithms for sparse representation. Neural Comput. 15(2), 349\u2013396 (2003)","journal-title":"Neural Comput."},{"key":"9913_CR55","doi-asserted-by":"crossref","unstructured":"Murray, J.F., Kreutz-Delgado, K.: An improved focuss-based learning algorithm for solving sparse linear inverse problems. In: IEEE International Conference on Signals, Systems and Computers 1, pp. 347\u2013351 (2001)","DOI":"10.1109\/ACSSC.2001.986949"},{"key":"9913_CR56","first-page":"1","volume":"4119","author":"K Kreutz-Delgado","year":"2000","unstructured":"Kreutz-Delgado, K., Rao, B.D.: Focuss-based dictionary learning algorithms. Wavel. Appl. Signal Image Process. VIII 4119, 1\u201353 (2000)","journal-title":"Wavel. Appl. Signal Image Process. VIII"},{"key":"9913_CR57","doi-asserted-by":"crossref","unstructured":"Li, S.Z., Hou, X.W., Zhang, H.J., Cheng, Q.S.: Learning spatially localized, parts-based representation. In: Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR2001) 1, pp. 207\u2013212 (2001)","DOI":"10.1109\/CVPR.2001.990477"},{"key":"9913_CR58","doi-asserted-by":"crossref","unstructured":"Zheng, W.S., Li, S.Z., Lai, J.H., Liao, S.C.: On constrained sparse matrix factorization. In: IEEE 11th International Conference on Computer Vision (ICCV2007), pp. 1\u20138 (2007)","DOI":"10.1109\/ICCV.2007.4408911"},{"key":"9913_CR59","unstructured":"Bittorf, V., Recht, B., R\u00e9, E., Tropp, J.A.: Factoring nonnegative matrices with linear programs. In: Advances in Neural Information Processing Systems (NIPS \u201912), pp. 1223\u20131231 (2012)"},{"issue":"2","key":"9913_CR60","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0169-7439(01)00119-8","volume":"57","author":"UMC Ara\u00fajo","year":"2001","unstructured":"Ara\u00fajo, U.M.C., Saldanha, B.T.C., Galvao, R.K.H., Yoneyama, T., Chame, H.C., Visani, V.: The successive projections algorithm for variable selection in spectroscopic multicomponent analysis. Chemom. Intell. Lab. Syst. 57(2), 65\u201373 (2001)","journal-title":"Chemom. Intell. Lab. Syst."},{"key":"9913_CR61","unstructured":"Kumar, A., Sindhwani, V., Kambadur, P.: Fast conical hull algorithms for near-separable non-negative matrix factorization. In Interantional Conferance on Machine Learning (ICML \u201913) 28, pp. 231\u2013239 (2013)"},{"key":"9913_CR62","first-page":"1249","volume":"15","author":"N Gillis","year":"2014","unstructured":"Gillis, N., Luce, R.: Robust near-separable nonnegative matrix factorization using linear optimization. J. Mach. Learn. Res. 15, 1249\u20131280 (2014)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-017-9913-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9913-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9913-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:39Z","timestamp":1750204419000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-017-9913-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,24]]},"references-count":62,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["9913"],"URL":"https:\/\/doi.org\/10.1007\/s10589-017-9913-x","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2017,4,24]]},"assertion":[{"value":"10 April 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2017","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}