{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T07:13:32Z","timestamp":1768979612145,"version":"3.49.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2014,10,12]],"date-time":"2014-10-12T00:00:00Z","timestamp":1413072000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s10618-014-0390-x","type":"journal-article","created":{"date-parts":[[2014,10,13]],"date-time":"2014-10-13T01:20:20Z","timestamp":1413163220000},"page":"1665-1684","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Quadratic regularization projected Barzilai\u2013Borwein method for nonnegative matrix factorization"],"prefix":"10.1007","volume":"29","author":[{"given":"Yakui","family":"Huang","sequence":"first","affiliation":[]},{"given":"Hongwei","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Shuisheng","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,12]]},"reference":[{"issue":"1","key":"390_CR1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai J, Borwein JM (1988) Two-point step size gradient methods. IMA J Numer Anal 8(1):141\u2013148","journal-title":"IMA J Numer Anal"},{"issue":"1","key":"390_CR2","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.csda.2006.11.006","volume":"52","author":"MW Berry","year":"2007","unstructured":"Berry MW, Browne M, Langville AN, Pauca VP, Plemmons RJ (2007) Algorithms and applications for approximate nonnegative matrix factorization. Computat Statist Data Anal 52(1):155\u2013173","journal-title":"Computat Statist Data Anal"},{"key":"390_CR3","volume-title":"Nonlinear programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas DP (1999) Nonlinear programming, 2nd edn. Athena Scientific, Belmont","edition":"2"},{"issue":"4","key":"390_CR4","doi-asserted-by":"crossref","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"EG Birgin","year":"2000","unstructured":"Birgin EG, Mart\u00ednez JM, Raydan M (2000) Nonmonotone spectral projected gradient methods on convex sets. SIAM J Optim 10(4):1196\u20131211","journal-title":"SIAM J Optim"},{"key":"390_CR5","unstructured":"Birgin EG, Mart\u00ednez JM, Raydan M (2012) Spectral projected gradient methods: Review and perspectives. http:\/\/www.ime.usp.br\/~egbirgin\/"},{"issue":"1","key":"390_CR6","doi-asserted-by":"crossref","first-page":"015002","DOI":"10.1088\/0266-5611\/25\/1\/015002","volume":"25","author":"S Bonettini","year":"2009","unstructured":"Bonettini S, Zanella R, Zanni L (2009) A scaled gradient projection method for constrained image deblurring. Inverse Probl 25(1):015002","journal-title":"Inverse Probl"},{"issue":"12","key":"390_CR7","doi-asserted-by":"crossref","first-page":"1624","DOI":"10.1109\/TKDE.2005.198","volume":"17","author":"D Cai","year":"2005","unstructured":"Cai D, He X, Han J (2005) Document clustering using locality preserving indexing. IEEE Trans Knowl Data Eng 17(12):1624\u20131637","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"8","key":"390_CR8","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.1109\/TPAMI.2010.231","volume":"33","author":"D Cai","year":"2011","unstructured":"Cai D, He X, Han J, Huang TS (2011) Graph regularized nonnegative matrix factorization for data representation. IEEE Trans Pattern Anal Mach Intell 33(8):1548\u20131560","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"390_CR9","doi-asserted-by":"crossref","unstructured":"Cichocki A, Zdunek R, Amari SI (2006) New algorithms for non-negative matrix factorization in applications to blind source separation. In: Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, pp 621\u2013624","DOI":"10.1109\/ICASSP.2006.1661352"},{"key":"390_CR10","doi-asserted-by":"crossref","DOI":"10.1002\/9780470747278","volume-title":"Nonnegative matrix and tensor factorizations: applications to exploratory multi-way data analysis and blind source separation","author":"A Cichocki","year":"2009","unstructured":"Cichocki A, Zdunek R, Phan AH, Amari SI (2009) Nonnegative matrix and tensor factorizations: applications to exploratory multi-way data analysis and blind source separation. Wiley, Chichester"},{"key":"390_CR11","unstructured":"Cieri C, Graff D, Liberman M, Martey N, Strassel S (1999) The TDT-2 text and speech corpus. In: Proceedings of the DARPA Broadcast News Workshop, pp 57\u201360"},{"issue":"3","key":"390_CR12","first-page":"327","volume":"28","author":"D Cores","year":"2009","unstructured":"Cores D, Escalante R, Gonz\u00e1lez-Lima M, Jimenez O (2009) On the use of the spectral projected gradient method for support vector machines. Comp Optim Appl 28(3):327\u2013364","journal-title":"Comp Optim Appl"},{"issue":"4","key":"390_CR13","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1023\/A:1013844413130","volume":"27","author":"YH Dai","year":"2001","unstructured":"Dai YH, Zhang H (2001) Adaptive two-point stepsize gradient algorithm. Numer Algor 27(4):377\u2013385","journal-title":"Numer Algor"},{"issue":"1","key":"390_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1093\/imanum\/22.1.1","volume":"22","author":"YH Dai","year":"2002","unstructured":"Dai YH, Liao LZ (2002) $$R$$ R -linear convergence of the Barzilai and Borwein gradient method. IMA J Numer Anal 22(1):1\u201310","journal-title":"IMA J Numer Anal"},{"issue":"1","key":"390_CR15","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s00211-004-0569-y","volume":"100","author":"YH Dai","year":"2005","unstructured":"Dai YH, Fletcher R (2005) Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming. Numer Math 100(1):21\u201347","journal-title":"Numer Math"},{"issue":"3","key":"390_CR16","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1093\/imanum\/drl006","volume":"26","author":"YH Dai","year":"2006","unstructured":"Dai YH, Hager WW, Schittkowski K, Zhang H (2006) The cyclic Barzilai\u2013Borwein method for unconstrained optimization. IMA J Numer Anal 26(3):604\u2013627","journal-title":"IMA J Numer Anal"},{"issue":"4","key":"390_CR17","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1109\/JSTSP.2007.910281","volume":"1","author":"MA Figueiredo","year":"2007","unstructured":"Figueiredo MA, Nowak RD, Wright SJ (2007) Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems. IEEE J Sel Top Signal Process 1(4):586\u2013597","journal-title":"IEEE J Sel Top Signal Process"},{"key":"390_CR18","volume-title":"On the Barzilai\u2013Borwein method. Optimization and control with applications, applied optimization","author":"R Fletcher","year":"2005","unstructured":"Fletcher R (2005) On the Barzilai\u2013Borwein method. Optimization and control with applications, applied optimization. Springer, New York"},{"issue":"9","key":"390_CR19","doi-asserted-by":"crossref","first-page":"3557","DOI":"10.1016\/j.patcog.2012.02.037","volume":"45","author":"P Gong","year":"2012","unstructured":"Gong P, Zhang C (2012) Efficient nonnegative matrix factorization via projected Newton method. Pattern Recognit 45(9):3557\u20133565","journal-title":"Pattern Recognit"},{"issue":"3","key":"390_CR20","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0167-6377(99)00074-7","volume":"26","author":"L Grippo","year":"2000","unstructured":"Grippo L, Sciandrone M (2000) On the convergence of the block nonlinear Gauss\u2013Seidel method under convex constraints. Oper Res Lett 26(3):127\u2013136","journal-title":"Oper Res Lett"},{"issue":"2","key":"390_CR21","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/A:1020587701058","volume":"23","author":"L Grippo","year":"2002","unstructured":"Grippo L, Sciandrone M (2002) Nonmonotone globalization techniques for the Barzilai\u2013Borwein gradient method. Comput Optim Appl 23(2):143\u2013169","journal-title":"Comput Optim Appl"},{"issue":"6","key":"390_CR22","doi-asserted-by":"crossref","first-page":"2882","DOI":"10.1109\/TSP.2012.2190406","volume":"60","author":"N Guan","year":"2012","unstructured":"Guan N, Tao D, Luo Z, Yuan B (2012) NeNMF: an optimal gradient method for nonnegative matrix factorization. IEEE Trans Signal Process 60(6):2882\u20132898","journal-title":"IEEE Trans Signal Process"},{"issue":"6","key":"390_CR23","first-page":"54","volume":"36","author":"L Han","year":"2009","unstructured":"Han L, Neumann M, Prasad U (2009) Alternating projected Barzilai-Borwein methods for nonnegative matrix factorization. Electron Trans Numer Anal 36(6):54\u201382","journal-title":"Electron Trans Numer Anal"},{"key":"390_CR24","first-page":"1457","volume":"5","author":"PO Hoyer","year":"2004","unstructured":"Hoyer PO (2004) Non-negative matrix factorization with sparseness constraints. J Mach Learn Res 5:1457\u20131469","journal-title":"J Mach Learn Res"},{"key":"390_CR25","doi-asserted-by":"crossref","unstructured":"Huang Y, Liu H, Zhou S (2013) A Barzilai\u2013Borwein type method for stochastic linear complementarity problems. Numer Algor. doi: 10.1007\/s11075-013-9803-y","DOI":"10.1007\/s11075-013-9803-y"},{"issue":"2","key":"390_CR26","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1137\/07069239X","volume":"30","author":"H Kim","year":"2008","unstructured":"Kim H, Park H (2008) Nonnegative matrix factorization based on alternating nonnegativity constrained least squares and active set method. SIAM J Matrix Anal Appl 30(2):713\u2013730","journal-title":"SIAM J Matrix Anal Appl"},{"key":"390_CR27","doi-asserted-by":"crossref","unstructured":"Kim D, Sra S, Dhillon IS (2007) Fast Newton-type methods for the least squares nonnegative matrix approximation problem. In: Proceedings of the 2007 SIAM International Conference on Data Mining, pp 343\u2013354","DOI":"10.1137\/1.9781611972771.31"},{"key":"390_CR28","unstructured":"Lee DD, Seung HS (2001) Algorithms for nonnegative matrix factorization. In: Advances in Neural Information Processing Systems, pp 556\u2013562"},{"issue":"6755","key":"390_CR29","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"DD Lee","year":"1999","unstructured":"Lee DD, Seung HS (1999) Learning the parts of objects by non-negative matrix factorization. Nature 401(6755):788\u2013791","journal-title":"Nature"},{"key":"390_CR30","first-page":"361","volume":"5","author":"DD Lewis","year":"2004","unstructured":"Lewis DD, Yang Y, Rose TG, Li F (2004) RCV1: a new benchmark collection for text categorization research. J Mach Learn Res 5:361\u2013397","journal-title":"J Mach Learn Res"},{"key":"390_CR31","doi-asserted-by":"crossref","unstructured":"Li SZ, Hou XW, Zhang HJ, Cheng QS (2001) Learning spatially localized, parts-based representation. In: Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp 207\u2013212","DOI":"10.1109\/CVPR.2001.990477"},{"issue":"10","key":"390_CR32","doi-asserted-by":"crossref","first-page":"2756","DOI":"10.1162\/neco.2007.19.10.2756","volume":"19","author":"CJ Lin","year":"2007","unstructured":"Lin CJ (2007) Projected gradient methods for nonnegative matrix factorization. Neural Comput 19(10):2756\u20132779","journal-title":"Neural Comput"},{"key":"390_CR33","unstructured":"Nesterov Y (1983) A method of solving a convex programming problem with convergence rate $$O(1\/k^2)$$ O ( 1 \/ k 2 ) . In: Soviet Mathematics Doklady, pp 372\u2013376"},{"issue":"2","key":"390_CR34","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1002\/env.3170050203","volume":"5","author":"P Paatero","year":"1994","unstructured":"Paatero P, Tapper U (1994) Positive matrix factorization: a non-negative factor model with optimal utilization of error estimates of data values. Environmetrics 5(2):111\u2013126","journal-title":"Environmetrics"},{"issue":"3","key":"390_CR35","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1109\/TPAMI.2006.60","volume":"28","author":"A Pascual-Montano","year":"2006","unstructured":"Pascual-Montano A, Carazo JM, Kochi K, Lehmann D, Pascual-Marqui R (2006) Nonsmooth nonnegative matrix factorization (nsNMF). IEEE Trans Pattern Anal Mach Intell 28(3):403\u2013415","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"390_CR36","doi-asserted-by":"crossref","unstructured":"Pauca VP (2004) Text mining using nonnegative matrix factorizations. In: Proceedings of the 2004 SIAM International Conference on Data Mining, pp 22\u201324","DOI":"10.1137\/1.9781611972740.45"},{"issue":"1","key":"390_CR37","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1137\/S1052623494266365","volume":"7","author":"M Raydan","year":"1997","unstructured":"Raydan M (1997) The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem. SIAM J Optim 7(1):26\u201333","journal-title":"SIAM J Optim"},{"issue":"2","key":"390_CR38","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/j.ipm.2004.11.005","volume":"42","author":"F Shahnaz","year":"2006","unstructured":"Shahnaz F, Berry MW, Pauca VP, Plemmons RJ (2006) Document clustering using nonnegative matrix factorization. J Inf Process Manage 42(2):373\u2013386","journal-title":"J Inf Process Manage"},{"issue":"3","key":"390_CR39","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1137\/070709967","volume":"20","author":"S Vavasis","year":"2009","unstructured":"Vavasis S (2009) On the complexity of nonnegative matrix factorization. SIAM J Optim 20(3):1364\u20131377","journal-title":"SIAM J Optim"},{"key":"390_CR40","doi-asserted-by":"crossref","unstructured":"Xu W, Liu X, Gong Y (2003) Document clustering based on non-negative matrix factorization. In: Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp 267\u2013273","DOI":"10.1145\/860435.860485"},{"key":"390_CR41","doi-asserted-by":"crossref","unstructured":"Zdunek R, Cichocki A (2006) Non-negative matrix factorization with quasi-Newton optimization. In: Proceedings of the 8th Artificial Intelligence and Soft Computing, pp 870\u2013879","DOI":"10.1007\/11785231_91"},{"issue":"4","key":"390_CR42","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"H Zhang","year":"2004","unstructured":"Zhang H, Hager WW (2004) A nonmonotone line search technique and its application to unconstrained optimization. SIAM J Optim 14(4):1043\u20131056","journal-title":"SIAM J Optim"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-014-0390-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-014-0390-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-014-0390-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:29:46Z","timestamp":1559230186000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-014-0390-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,12]]},"references-count":42,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["390"],"URL":"https:\/\/doi.org\/10.1007\/s10618-014-0390-x","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,12]]}}}