{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T18:04:23Z","timestamp":1785434663562,"version":"3.56.0"},"reference-count":34,"publisher":"Public Library of Science (PLoS)","issue":"7","license":[{"start":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T00:00:00Z","timestamp":1785369600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Shaanxi Provincial Natural Science Foundation Project","award":["2023-JC-QN-0088"],"award-info":[{"award-number":["2023-JC-QN-0088"]}]},{"name":"the Major Science and Technology Special Project of Xinjiang Uygur Autonomous Region","award":["2024A03007,2023A02002"],"award-info":[{"award-number":["2024A03007,2023A02002"]}]},{"name":"Water Special Project of Xinjiang Uygur Autonomous Region","award":["2025. B-001"],"award-info":[{"award-number":["2025. B-001"]}]}],"content-domain":{"domain":["www.plosone.org"],"crossmark-restriction":false},"short-container-title":["PLoS One"],"abstract":"<jats:p>In this paper, we present a modified nonmonotone line search algorithm that employs a variable parameter to control the degree of nonmonotonicity. This modification enhances both the probability of identifying the global minimum and the rate of convergence. Within the framework of alternating nonnegative least squares (ANLS), we propose a hybrid algorithm that employs either the modified nonmonotone projected Barzilai\u2013Borwein method and the block coordinate descent method to address the subproblems in each iteration. To further accelerate convergence, we integrate a technique that allows for a larger step size. Under mild assumptions, we establish the global convergence of the algorithm. Numerical experiments conducted on both synthetic and real datasets demonstrate that the proposed algorithm is efficient for nonnegative matrix factorization (NMF) and outperforms other state-of-the-art methods.<\/jats:p>","DOI":"10.1371\/journal.pone.0344857","type":"journal-article","created":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T17:24:51Z","timestamp":1785432291000},"page":"e0344857","update-policy":"https:\/\/doi.org\/10.1371\/journal.pone.corrections_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient hybrid algorithm for nonnegative matrix factorization based on modified nonmonotone linear search"],"prefix":"10.1371","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2836-3239","authenticated-orcid":true,"given":"Jing","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-3669-3040","authenticated-orcid":true,"given":"Wenbo","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lijun","family":"Su","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huiru","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yike","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"340","published-online":{"date-parts":[[2026,7,30]]},"reference":[{"issue":"9","key":"pone.0344857.ref001","doi-asserted-by":"crossref","first-page":"3557","DOI":"10.1016\/j.patcog.2012.02.037","article-title":"Efficient Nonnegative Matrix Factorization via projected Newton method","volume":"45","author":"P Gong","year":"2012","journal-title":"Pattern Recognition"},{"key":"pone.0344857.ref002","doi-asserted-by":"crossref","unstructured":"Kim D, Sra S, Dhillon IS. Fast Newton-type Methods for the Least Squares Nonnegative Matrix Approximation Problem. In: Proceedings of the 2007 SIAM International Conference on Data Mining. 2007. p. 343\u201354.","DOI":"10.1137\/1.9781611972771.31"},{"issue":"6755","key":"pone.0344857.ref003","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","article-title":"Learning the parts of objects by non-negative matrix factorization","volume":"401","author":"DD Lee","year":"1999","journal-title":"Nature"},{"key":"pone.0344857.ref004","first-page":"556","article-title":"Algorithms for non-negative matrix factorization","volume":"13","author":"DD Lee","year":"2001","journal-title":"Adv Neural Inform Process Syst"},{"issue":"2","key":"pone.0344857.ref005","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1002\/env.3170050203","article-title":"Positive matrix factorization: A non\u2010negative factor model with optimal utilization of error estimates of data values","volume":"5","author":"P Paatero","year":"1994","journal-title":"Environmetrics"},{"key":"pone.0344857.ref006","article-title":"The why and how of nonnegative matrix factorization","author":"N Gillis","year":"2014","journal-title":"Int J Syst Sci"},{"key":"pone.0344857.ref007","doi-asserted-by":"crossref","unstructured":"Guillamet D, Schiele B, Vitri\u00e0 J. Analyzing non-negative matrix factorization for image classification. In: 16th International Conference on Pattern Recognition (ICPR). 2002. p. 116\u20139.","DOI":"10.1109\/ICPR.2002.1048251"},{"key":"pone.0344857.ref008","doi-asserted-by":"crossref","unstructured":"Pauca VP, Shahnaz F, Berry MW, Plemmons RJ. Text mining using nonnegative matrix factorization. In: Proceedings of the Fourth SIAM International Conference on Data Mining. 2004. p. 452\u20136.","DOI":"10.1137\/1.9781611972740.45"},{"key":"pone.0344857.ref009","doi-asserted-by":"crossref","unstructured":"Hualiang Li, Adali T, Wei W, Emge D. Non-Negative Matrix Factorization with Orthogonality Constraints for Chemical Agent Detection in Raman Spectra. In: 2005 IEEE Workshop on Machine Learning for Signal Processing. 2005. p. 253\u20138.","DOI":"10.1109\/MLSP.2005.1532909"},{"issue":"7","key":"pone.0344857.ref010","doi-asserted-by":"crossref","first-page":"1706","DOI":"10.1101\/gr.903503","article-title":"Subsystem identification through dimensionality reduction of large-scale gene expression data","volume":"13","author":"PM Kim","year":"2003","journal-title":"Genome Res"},{"issue":"2","key":"pone.0344857.ref011","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/j.ipm.2004.11.005","article-title":"Document clustering using nonnegative matrix factorization","volume":"42","author":"F Shahnaz","year":"2006","journal-title":"Inform Process Manag"},{"issue":"10","key":"pone.0344857.ref012","doi-asserted-by":"crossref","first-page":"2756","DOI":"10.1162\/neco.2007.19.10.2756","article-title":"Projected gradient methods for nonnegative matrix factorization","volume":"19","author":"C-J Lin","year":"2007","journal-title":"Neural Comput"},{"key":"pone.0344857.ref013","first-page":"54","article-title":"Alternating projected Barzilai-Borwein methods for nonnegative matrix factorization","volume":"36","author":"L Han","year":"2009","journal-title":"ETNA"},{"issue":"6","key":"pone.0344857.ref014","doi-asserted-by":"crossref","first-page":"2882","DOI":"10.1109\/TSP.2012.2190406","article-title":"NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization","volume":"60","author":"N Guan","year":"2012","journal-title":"IEEE Trans Signal Process"},{"issue":"6","key":"pone.0344857.ref015","doi-asserted-by":"crossref","first-page":"1665","DOI":"10.1007\/s10618-014-0390-x","article-title":"Quadratic regularization projected Barzilai\u2013Borwein method for nonnegative matrix factorization","volume":"29","author":"Y Huang","year":"2014","journal-title":"Data Min Knowl Disc"},{"issue":"6","key":"pone.0344857.ref016","doi-asserted-by":"crossref","first-page":"1665","DOI":"10.1007\/s10618-014-0390-x","article-title":"Quadratic regularization projected Barzilai\u2013Borwein method for nonnegative matrix factorization","volume":"29","author":"Y Huang","year":"2014","journal-title":"Data Min Knowl Disc"},{"issue":"1","key":"pone.0344857.ref017","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate O(1\/k2)","volume":"27","author":"Y Nesterov","year":"1983","journal-title":"Soviet Mathematics Doklady"},{"issue":"4","key":"pone.0344857.ref018","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1007\/s40305-023-00470-8","article-title":"Accelerated Stochastic Peaceman\u2013Rachford Method for Empirical Risk Minimization","volume":"11","author":"J-C Bai","year":"2023","journal-title":"J Oper Res Soc China"},{"issue":"3","key":"pone.0344857.ref019","doi-asserted-by":"crossref","first-page":"448","DOI":"10.4208\/csiam-am.SO-2021-0021","article-title":"Convergence on a Symmetric Accelerated Stochastic ADMM with Larger Stepsizes","volume":"3","author":"J Bai","year":"2022","journal-title":"CSIAM-AM"},{"issue":"2","key":"pone.0344857.ref020","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10589-021-00338-8","article-title":"An inexact accelerated stochastic ADMM for separable convex optimization","volume":"81","author":"J Bai","year":"2022","journal-title":"Comput Optim Appl"},{"issue":"1","key":"pone.0344857.ref021","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s10589-017-9971-0","article-title":"Generalized symmetric ADMM for separable convex optimization","volume":"70","author":"J Bai","year":"2017","journal-title":"Comput Optim Appl"},{"issue":"7","key":"pone.0344857.ref022","doi-asserted-by":"crossref","first-page":"1589","DOI":"10.1007\/s11590-017-1195-9","article-title":"A parameterized proximal point algorithm for separable convex optimization","volume":"12","author":"J Bai","year":"2017","journal-title":"Optim Lett"},{"issue":"8","key":"pone.0344857.ref023","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1080\/00207728108963798","article-title":"A generalized proximal point algorithm for certain non-convex minimization problems","volume":"12","author":"M Fukushima","year":"1981","journal-title":"Int J Syst Sci"},{"issue":"1","key":"pone.0344857.ref024","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","article-title":"Two-Point Step Size Gradient Methods","volume":"8","author":"J Barzilai","year":"1988","journal-title":"IMA J Numer Anal"},{"issue":"4","key":"pone.0344857.ref025","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1137\/0723046","article-title":"A Nonmonotone Line Search Technique for Newton\u2019s Method","volume":"23","author":"L Grippo","year":"1986","journal-title":"SIAM J Numer Anal"},{"issue":"4","key":"pone.0344857.ref026","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1137\/S1052623403428208","article-title":"A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization","volume":"14","author":"H Zhang","year":"2004","journal-title":"SIAM J Optim"},{"issue":"9","key":"pone.0344857.ref027","doi-asserted-by":"crossref","first-page":"2158","DOI":"10.1016\/j.camwa.2007.08.038","article-title":"Incorporating nonmonotone strategies into the trust region method for unconstrained optimization","volume":"55","author":"N Gu","year":"2008","journal-title":"Comput Math Appl"},{"issue":"4","key":"pone.0344857.ref028","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1080\/02331934.2011.641126","article-title":"A class of nonmonotone Armijo-type line search method for unconstrained optimization","volume":"61","author":"M Ahookhosh","year":"2012","journal-title":"Optimization"},{"issue":"4","key":"pone.0344857.ref029","doi-asserted-by":"crossref","first-page":"1217","DOI":"10.1007\/s10092-017-0226-3","article-title":"On the nonmonotonicity degree of nonmonotone line searches","volume":"54","author":"H Nosratipour","year":"2017","journal-title":"Calcolo"},{"issue":"3","key":"pone.0344857.ref030","doi-asserted-by":"crossref","first-page":"1758","DOI":"10.1137\/120887795","article-title":"A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion","volume":"6","author":"Y Xu","year":"2013","journal-title":"SIAM J Imaging Sci"},{"key":"pone.0344857.ref031","first-page":"9","article-title":"Conjugate gradient methods and nonlinear optimization.","volume-title":"Linear and Nonlinear Conjugate Gradient-Related Methods","author":"J. Nocedal","year":"1996"},{"key":"pone.0344857.ref032","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-12613-4","volume-title":"Numerical Methods for Nonlinear Variational Problems","author":"R Glowinski","year":"1984"},{"issue":"4","key":"pone.0344857.ref033","doi-asserted-by":"crossref","first-page":"1196","DOI":"10.1137\/S1052623497330963","article-title":"Nonmonotone Spectral Projected Gradient Methods on Convex Sets","volume":"10","author":"EG Birgin","year":"2000","journal-title":"SIAM J Optim"},{"key":"pone.0344857.ref034","first-page":"169","article-title":"Hierarchical ALS algorithms for nonnegative matrix and 3D tensor factorization","volume-title":"Lecture Notes in Computer Science","author":"A Cichocki","year":"2007"}],"container-title":["PLOS One"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dx.plos.org\/10.1371\/journal.pone.0344857","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T17:24:57Z","timestamp":1785432297000},"score":1,"resource":{"primary":{"URL":"https:\/\/dx.plos.org\/10.1371\/journal.pone.0344857"}},"subtitle":[],"editor":[{"given":"Jianchao","family":"Bai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"editor"}]}],"short-title":[],"issued":{"date-parts":[[2026,7,30]]},"references-count":34,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2026,7,30]]}},"URL":"https:\/\/doi.org\/10.1371\/journal.pone.0344857","relation":{},"ISSN":["1932-6203"],"issn-type":[{"value":"1932-6203","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,30]]}}}