{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T08:12:03Z","timestamp":1772525523005,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T00:00:00Z","timestamp":1624838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T00:00:00Z","timestamp":1624838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71671190"],"award-info":[{"award-number":["71671190"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012476","name":"Fundamental Research Funds for Central Universities of the Central South University","doi-asserted-by":"publisher","award":["206021706"],"award-info":[{"award-number":["206021706"]}],"id":[{"id":"10.13039\/501100012476","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010083","name":"Hunan Provincial Innovation Foundation for Postgraduate","doi-asserted-by":"publisher","award":["1501110022"],"award-info":[{"award-number":["1501110022"]}],"id":[{"id":"10.13039\/501100010083","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s10618-021-00773-5","type":"journal-article","created":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T02:02:30Z","timestamp":1624845750000},"page":"1972-2008","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["An alternating nonmonotone projected Barzilai\u2013Borwein algorithm of nonnegative factorization of big matrices"],"prefix":"10.1007","volume":"35","author":[{"given":"Ting","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiayi","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3652-2460","authenticated-orcid":false,"given":"Zhong","family":"Wan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,28]]},"reference":[{"key":"773_CR1","doi-asserted-by":"publisher","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 length gradient methods. IMA J Numer Anal 8:141\u2013148. https:\/\/doi.org\/10.1093\/imanum\/8.1.141","journal-title":"IMA J Numer Anal"},{"key":"773_CR2","doi-asserted-by":"publisher","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. Comput Stat Data Anal 52:155\u2013173. https:\/\/doi.org\/10.1016\/j.csda.2006.11.006","journal-title":"Comput Stat Data Anal"},{"key":"773_CR3","volume-title":"Nonlinear programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas DP (1999) Nonlinear programming, 2nd edn. Athena Scientific, Belmont","edition":"2"},{"key":"773_CR4","doi-asserted-by":"publisher","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:1196\u20131211. https:\/\/doi.org\/10.1137\/S1052623497330963","journal-title":"SIAM J Optim"},{"key":"773_CR5","doi-asserted-by":"publisher","first-page":"1624","DOI":"10.1109\/TKDE.2005.198","volume":"17","author":"D Cai","year":"2005","unstructured":"Cai D, He XF, Han JW (2005) Document clustering using locality preserving indexing. IEEE Trans Knowl Data Eng 17:1624\u20131637. https:\/\/doi.org\/10.1109\/TKDE.2005.198","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"773_CR6","doi-asserted-by":"publisher","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\u2013Borwein methods for large-scale box-constrained quadratic programming. Numer Math 100:21\u201347. https:\/\/doi.org\/10.1007\/s00211-004-0569-y","journal-title":"Numer Math"},{"key":"773_CR7","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan ED, Mor\u00e9 JJ (2002) Benchmarking optimization software with performance profiles. Math Program 91:201\u2013213. https:\/\/doi.org\/10.1007\/s101070100263","journal-title":"Math Program"},{"key":"773_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1109\/MSP.2018.2877582","volume":"36","author":"X Fu","year":"2019","unstructured":"Fu X, Huang K, Sidiropoulos ND, Ma WK (2019) Nonnegative matrix factorization for signal and data analytics: identifiability, algorithms, and applications. IEEE Signal Process Mag 36:59\u201380. https:\/\/doi.org\/10.1109\/MSP.2018.2877582","journal-title":"IEEE Signal Process Mag"},{"key":"773_CR9","unstructured":"Gillis N, Glineur F (2008) Nonnegative factorization and the maximum edge biclique problem. ArXiv e-prints arXiv:0810.4225"},{"key":"773_CR10","doi-asserted-by":"publisher","first-page":"3557","DOI":"10.1016\/j.patcog.2012.02.037","volume":"45","author":"PH Gong","year":"2012","unstructured":"Gong PH, Zhang CS (2012) Efficient nonnegative matrix factorization via projected Newton method. Pattern Recognit 45:3557\u20133565. https:\/\/doi.org\/10.1016\/j.patcog.2012.02.037","journal-title":"Pattern Recognit"},{"key":"773_CR11","doi-asserted-by":"publisher","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:127\u2013136. https:\/\/doi.org\/10.1016\/S0167-6377(99)00074-7","journal-title":"Oper Res Lett"},{"key":"773_CR12","doi-asserted-by":"publisher","first-page":"2882","DOI":"10.1109\/TSP.2012.2190406","volume":"60","author":"NY Guan","year":"2012","unstructured":"Guan NY, Tao DC, Luo ZG, Yuan B (2012) NeNMF: an optimal gradient method for nonnegative matrix factorization. IEEE Trans Signal Process 60:2882\u20132898. https:\/\/doi.org\/10.1109\/TSP.2012.2190406","journal-title":"IEEE Trans Signal Process"},{"key":"773_CR13","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1137\/050635225","volume":"17","author":"WW Hager","year":"2006","unstructured":"Hager WW, Zhang HC (2006) A new active set algorithm for box constrained optimization. SIAM J Optim 17:526\u2013557. https:\/\/doi.org\/10.1137\/050635225","journal-title":"SIAM J Optim"},{"key":"773_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.7153\/oam-03-02","volume":"3","author":"J Han","year":"2009","unstructured":"Han J, Han LX, Neumann M, Prasad U (2009a) On the rate of convergence of the image space reconstruction algorithm. Oper Matrices 3:41\u201358. https:\/\/doi.org\/10.7153\/oam-03-02","journal-title":"Oper Matrices"},{"key":"773_CR15","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-0-8176-4751-3_16","volume":"36","author":"LX Han","year":"2009","unstructured":"Han LX, Neumann M, Prasad AU (2009b) Alternating projected Barzilai\u2013Borwein methods for nonnegative matrix factorization. Electron Trans Numer Anal 36:54\u201382. https:\/\/doi.org\/10.1007\/978-0-8176-4751-3_16","journal-title":"Electron Trans Numer Anal"},{"key":"773_CR16","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.1016\/j.neucom.2011.09.024","volume":"5","author":"PO Hoyer","year":"2004","unstructured":"Hoyer PO (2004) Nonnegative matrix factorization with sparseness constraints. J Mach Learn Res 5:1457\u20131469. https:\/\/doi.org\/10.1016\/j.neucom.2011.09.024","journal-title":"J Mach Learn Res"},{"key":"773_CR17","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.cam.2016.09.014","volume":"313","author":"S Huang","year":"2017","unstructured":"Huang S, Wan Z (2017) A new nonmonotone spectral residual method for nonsmooth nonlinear equations. J Comput Appl Math 313:82\u2013101. https:\/\/doi.org\/10.1016\/j.cam.2016.09.014","journal-title":"J Comput Appl Math"},{"key":"773_CR18","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1016\/j.cam.2017.09.026","volume":"330","author":"S Huang","year":"2018","unstructured":"Huang S, Wan Z, Zhang J (2018) An extended nonmonotone line search technique for large-scale unconstrained optimization. J Comput Appl Math 330:586\u2013604. https:\/\/doi.org\/10.1016\/j.cam.2017.09.026","journal-title":"J Comput Appl Math"},{"key":"773_CR19","doi-asserted-by":"publisher","first-page":"1665","DOI":"10.1007\/s10618-014-0390-x","volume":"29","author":"YK Huang","year":"2015","unstructured":"Huang YK, Liu HW, Zhou SS (2015a) Quadratic regularization projected Barzilai\u2013Borwein method for nonnegative matrix factorization. Data Min Knowl Discov 29:1665\u20131684. https:\/\/doi.org\/10.1007\/s10618-014-0390-x","journal-title":"Data Min Knowl Discov"},{"key":"773_CR20","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.aml.2015.01.003","volume":"45","author":"YK Huang","year":"2015","unstructured":"Huang YK, Liu HW, Zhou SS (2015b) An efficient monotone projected Barzilai\u2013Borwein method for nonnegative matrix factorization. Appl Math Lett 45:12\u201317. https:\/\/doi.org\/10.1016\/j.aml.2015.01.003","journal-title":"Appl Math Lett"},{"key":"773_CR21","doi-asserted-by":"crossref","unstructured":"Kim DM, Sra S, Dhillon IS (2007) Fast Newton-type methods for the least squares nonnegative matrix approximation problem","DOI":"10.1137\/1.9781611972771.31"},{"key":"773_CR22","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/07069239X","volume":"30","author":"H Kim","year":"2008","unstructured":"Kim H, Park H (2008a) Nonnegative matrix factorization based on alternating nonnegativity constrained least squares and active set method. SIAM J Matrix Anal Appl 30:713\u2013730. https:\/\/doi.org\/10.1137\/07069239X","journal-title":"SIAM J Matrix Anal Appl"},{"key":"773_CR23","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.149","author":"J Kim","year":"2008","unstructured":"Kim J, Park H (2008b) Toward faster nonnegative matrix factorization: a new algorithm and comparisons. Proc Eighth IEEE Int Conf Data Min. https:\/\/doi.org\/10.1109\/ICDM.2008.149","journal-title":"Proc Eighth IEEE Int Conf Data Min"},{"key":"773_CR24","doi-asserted-by":"publisher","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:788\u2013791. https:\/\/doi.org\/10.1038\/44565","journal-title":"Nature"},{"key":"773_CR25","doi-asserted-by":"publisher","first-page":"516","DOI":"10.4208\/nmtma.OA-2019-0028","volume":"13","author":"JC Li","year":"2020","unstructured":"Li JC, Li WB, Liu XN (2020) An adaptive nonmonotone projected Barzilai\u2013Borwein gradient method with active set prediction for nonnegative matrix factorization. Numer Math Theor Meth Appl 13:516\u2013538. https:\/\/doi.org\/10.4208\/nmtma.OA-2019-0028","journal-title":"Numer Math Theor Meth Appl"},{"key":"773_CR26","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1017\/S1446181118000263","volume":"61","author":"T Li","year":"2019","unstructured":"Li T, Wan Z (2019) New adaptive Barzilai\u2013Borwein step size and its application in solving large scale optimization problems. ANZIAM J 61:76\u201398. https:\/\/doi.org\/10.1017\/S1446181118000263","journal-title":"ANZIAM J"},{"key":"773_CR27","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.camwa.2016.11.017","volume":"73","author":"XL Li","year":"2017","unstructured":"Li XL, Zhang W, Dong XL (2017) A class of modified FR conjugate gradient method and applications to non-negative matrix factorization. Comput Math Appl 73:270\u2013276. https:\/\/doi.org\/10.1016\/j.camwa.2016.11.017","journal-title":"Comput Math Appl"},{"key":"773_CR28","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1109\/TNNLS.2017.2691725","volume":"29","author":"Z Li","year":"2018","unstructured":"Li Z, Tang J, He X (2018) Robust structured nonnegative matrix factorization for image representation. IEEE Trans Neural Netw Learn Syst 29:1947\u20131960. https:\/\/doi.org\/10.1109\/TNNLS.2017.2691725","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"773_CR29","doi-asserted-by":"publisher","first-page":"1589","DOI":"10.1109\/TNN.2007.895831","volume":"18","author":"CJ Lin","year":"2007","unstructured":"Lin CJ (2007a) On the convergence of multiplicative update algorithms for nonnegative matrix factorization. IEEE Trans Neural Netw 18:1589\u20131596. https:\/\/doi.org\/10.1109\/TNN.2007.895831","journal-title":"IEEE Trans Neural Netw"},{"key":"773_CR30","doi-asserted-by":"publisher","first-page":"2756","DOI":"10.1162\/neco.2007.19.10.2756","volume":"19","author":"CJ Lin","year":"2007","unstructured":"Lin CJ (2007b) Projected gradient methods for nonnegative matrix factorization. Neural Comput 19:2756\u20132779. https:\/\/doi.org\/10.1162\/neco.2007.19.10.2756","journal-title":"Neural Comput"},{"key":"773_CR31","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/env.3170050203","volume":"5","author":"P Paarero","year":"1994","unstructured":"Paarero P, Tapper U (1994) Positive matrix factorization: a nonnegative factor model with optimal utilization of error estimates of data values. Environmetrics 5:111\u2013126. https:\/\/doi.org\/10.1002\/env.3170050203","journal-title":"Environmetrics"},{"key":"773_CR32","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh N, Boyd S (2014) Proximal algorithms. Found Trends Optim 1:127\u2013239. https:\/\/doi.org\/10.1561\/2400000003","journal-title":"Found Trends Optim"},{"key":"773_CR33","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.laa.2005.06.025","volume":"416","author":"VP Pauca","year":"2006","unstructured":"Pauca VP, Piper J, Plemmons RJ (2006) Nonnegative matrix factorization for spectral data analysis. Linear Algebra Appl 416:29\u201347. https:\/\/doi.org\/10.1016\/j.laa.2005.06.025","journal-title":"Linear Algebra Appl"},{"key":"773_CR34","doi-asserted-by":"crossref","unstructured":"Pauca VP, Shahnaz F, Berry MW, Plemmons RJ (2004) Text mining using non-negative matrix factorization","DOI":"10.1137\/1.9781611972740.45"},{"key":"773_CR35","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/s10915-021-01489-w","volume":"87","author":"JY Tang","year":"2021","unstructured":"Tang JY, Wan Z (2021) Orthogonal dual graph-regularized nonnegative matrix factorization for co-clustering. J Sci Comput 87:66. https:\/\/doi.org\/10.1007\/s10915-021-01489-w","journal-title":"J Sci Comput"},{"key":"773_CR36","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/070709967","volume":"20","author":"SA Vavasis","year":"2009","unstructured":"Vavasis SA (2009) On the complexity of nonnegative matrix factorization. SIAM J Optim 20:1364\u20131377. https:\/\/doi.org\/10.1137\/070709967","journal-title":"SIAM J Optim"},{"key":"773_CR37","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1007\/s11760-018-1300-2","volume":"12","author":"Z Wan","year":"2018","unstructured":"Wan Z, Guo J, Liu JJ, Liu WY (2018) A modified spectral conjugate gradient projection method for signal recovery. Signal Image Video Process 12:1455\u20131462. https:\/\/doi.org\/10.1007\/s11760-018-1300-2","journal-title":"Signal Image Video Process"},{"key":"773_CR38","doi-asserted-by":"publisher","first-page":"911","DOI":"10.3389\/fgene.2019.00911","volume":"10","author":"Z Wan","year":"2019","unstructured":"Wan Z, Tang JY, Ren L, Xiao YM, Liu SJ (2019) Optimization techniques to deeply mine the transciptomic profile of the sub-genomes in hybrid fish lineage. Front Genet 10:911. https:\/\/doi.org\/10.3389\/fgene.2019.00911","journal-title":"Front Genet"},{"key":"773_CR39","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1186\/s12863-016-0457-3","volume":"17","author":"J Xiao","year":"2016","unstructured":"Xiao J, Hu FZ, Luo KK, Li WH, Liu SJ (2016) Unique nucleolar dominance patterns in distant hybrid lineage derived from Megalobrama Amblycephala $$\\times $$ Culter Alburnus. BMC Genet 17:150. https:\/\/doi.org\/10.1186\/s12863-016-0457-3","journal-title":"BMC Genet"},{"key":"773_CR40","doi-asserted-by":"publisher","first-page":"1758","DOI":"10.1137\/120887795","volume":"6","author":"YY Xu","year":"2013","unstructured":"Xu YY, Yin WT (2013) A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion. SIAM J Imaging Sci 6:1758\u20131789. https:\/\/doi.org\/10.1137\/120887795","journal-title":"SIAM J Imaging Sci"},{"key":"773_CR41","doi-asserted-by":"crossref","unstructured":"Zdunek R, Cichocki A (2006) Non-negative matrix factorization with quasi-Newton optimization. In: Proceedings of the eighth international conference on artificial intelligence and soft computing (ICAISC 2006)","DOI":"10.1007\/11785231_91"},{"key":"773_CR42","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/s10489-019-01539-9","volume":"50","author":"L Zhang","year":"2020","unstructured":"Zhang L, Liu ZH, Pu JX, Song B (2020) Adaptive graph regularized nonnegative matrix factorization for data representation. Appl Intell 50:438\u2013447. https:\/\/doi.org\/10.1007\/s10489-019-01539-9","journal-title":"Appl Intell"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-021-00773-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-021-00773-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-021-00773-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,30]],"date-time":"2021-08-30T06:29:52Z","timestamp":1630304992000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-021-00773-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,28]]},"references-count":42,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["773"],"URL":"https:\/\/doi.org\/10.1007\/s10618-021-00773-5","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,28]]},"assertion":[{"value":"27 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We declare that all the authors have no any conflict of interest about submission and publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"All the computer codes used in this study are available from the corresponding author upon request.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}