{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T01:04:10Z","timestamp":1780016650358,"version":"3.53.1"},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational and Applied Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.cam.2026.117526","type":"journal-article","created":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T20:34:45Z","timestamp":1772483685000},"page":"117526","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A novel subspace-minimization conjugate gradient algorithm with non-monotone line search for solving large scale unconstrained optimization problems"],"prefix":"10.1016","volume":"485","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-8989-7036","authenticated-orcid":false,"given":"Jie","family":"Guo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-8591-1213","authenticated-orcid":false,"given":"Ting","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6787-0420","authenticated-orcid":false,"given":"Junhong","family":"Miao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3652-2460","authenticated-orcid":false,"given":"Zhong","family":"Wan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.cam.2026.117526_bib0001","first-page":"76","article-title":"New adaptive barzilar-borwein step size and its application in solving large scale optimization problems","volume":"61","author":"Li","year":"2019","journal-title":"ANZIAM J."},{"key":"10.1016\/j.cam.2026.117526_bib0002","doi-asserted-by":"crossref","DOI":"10.1142\/S1793962321500537","article-title":"A new three-term spectral conjugate gradient algorithm with higher numerical performance for solving large scale optimization problems based on quasi-Newton equation","volume":"12","author":"Guo","year":"2021","journal-title":"Int. J. Model Simul. Sci. Comput."},{"key":"10.1016\/j.cam.2026.117526_bib0003","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/zamm.19950750118","article-title":"A subspace study on conjugate gradient algorithms","volume":"75","author":"Yuan","year":"1995","journal-title":"Z. Angew. Math. Mech."},{"key":"10.1016\/j.cam.2026.117526_bib0004","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":"Barzilai","year":"1988","journal-title":"IMA. J. Numer. Anal."},{"key":"10.1016\/j.cam.2026.117526_bib0005","doi-asserted-by":"crossref","first-page":"1511","DOI":"10.1007\/s11425-016-0279-2","article-title":"Borwein conjugate gradient method","volume":"59","author":"Dai","year":"2016","journal-title":"Sci. China Math."},{"key":"10.1016\/j.cam.2026.117526_bib0006","first-page":"859","article-title":"An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization","volume":"65","author":"Andrei","year":"2014","journal-title":"Numer. Math."},{"key":"10.1016\/j.cam.2026.117526_bib0007","first-page":"195","article-title":"A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization","volume":"79","author":"Li","year":"2018","journal-title":"Numer. Math."},{"key":"10.1016\/j.cam.2026.117526_bib0008","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/0717023","article-title":"Conic approximations and collinear scalings for optimizers","volume":"17","author":"Davidon","year":"1980","journal-title":"Siam J. Numer. Anal."},{"key":"10.1016\/j.cam.2026.117526_bib0009","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1137\/0717011","article-title":"The Q-superlinear convergence of a collinear scaling algorithm for unconstrained optimization","volume":"17","author":"Sorensen","year":"1980","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/j.cam.2026.117526_bib0010","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s40314-019-0779-7","article-title":"A subspace minimization conjugate gradient method based on conic model for unconstrained optimization","volume":"38","author":"Li","year":"2019","journal-title":"Comput. Appl. Math."},{"key":"10.1016\/j.cam.2026.117526_bib0011","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/s40314-022-01885-4","article-title":"A new subspace minimization conjugate gradient method based on conic model for large-scale unconstrained optimization","volume":"41","author":"Sun","year":"2022","journal-title":"Comput. Appl. Math."},{"key":"10.1016\/j.cam.2026.117526_bib0012","doi-asserted-by":"crossref","first-page":"1924","DOI":"10.1080\/00207160.2018.1542136","article-title":"A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization","volume":"96","author":"Wang","year":"2018","journal-title":"Int. J. Comput. Math."},{"key":"10.1016\/j.cam.2026.117526_bib0013","first-page":"813","article-title":"A subspace conjugate gradient algorithm for large-scale unconstrained optimization","volume":"76","author":"Yang","year":"2017","journal-title":"Numer. Math."},{"key":"10.1016\/j.cam.2026.117526_bib0014","first-page":"1501","article-title":"New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization","volume":"87","author":"Zhao","year":"2021","journal-title":"Numer. Math."},{"key":"10.1016\/j.cam.2026.117526_bib0015","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":"Zhang","year":"2004","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2026.117526_bib0016","doi-asserted-by":"crossref","DOI":"10.1016\/j.cam.2023.115563","article-title":"A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in m\u202f\u00d7\u202fn real matrix space with application in image clustering","volume":"438","author":"Li","year":"2024","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.cam.2026.117526_bib0017","doi-asserted-by":"crossref","first-page":"1845","DOI":"10.1007\/s11590-013-0678-6","article-title":"A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations","volume":"8","author":"Wan","year":"2014","journal-title":"Optim. Lett."},{"key":"10.1016\/j.cam.2026.117526_bib0018","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1137\/100813026","article-title":"A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search","volume":"23","author":"Dai","year":"2013","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2026.117526_bib0019","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1007\/s10957-018-1393-3","article-title":"An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization","volume":"180","author":"Liu","year":"2019","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/j.cam.2026.117526_bib0020","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/j.amc.2009.03.020","article-title":"Acceleration of conjugate gradient algorithms for unconstrained optimization","volume":"213","author":"Andrei","year":"2009","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.cam.2026.117526_bib0021","first-page":"147","article-title":"An unconstrained optimization test functions collection","volume":"10","author":"Andrei","year":"2008","journal-title":"Adv. Model. Optim."},{"key":"10.1016\/j.cam.2026.117526_bib0022","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/200979.201043","article-title":"Cute: constrained and unconstrained testing environment","volume":"21","author":"Bongartz","year":"1995","journal-title":"ACM T. Math. Software"},{"key":"10.1016\/j.cam.2026.117526_bib0023","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1137\/030601880","article-title":"A new conjugate gradient method with guaranteed descent and an efficient line search","volume":"16","author":"Hager","year":"2005","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2026.117526_bib0024","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/j.cam.2018.10.035","article-title":"A new conjugate gradient method based on quasi-Newton equation for unconstrained optimization","volume":"350","author":"Li","year":"2019","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.cam.2026.117526_bib0025","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","article-title":"Benchmarking optimization software with performance profiles","volume":"91","author":"Dolan","year":"2002","journal-title":"Math. Program."},{"key":"10.1016\/j.cam.2026.117526_bib0026","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":"Guan","year":"2012","journal-title":"IEEE Signal Process."},{"key":"10.1016\/j.cam.2026.117526_bib0027","doi-asserted-by":"crossref","first-page":"1972","DOI":"10.1007\/s10618-021-00773-5","article-title":"An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices","volume":"35","author":"Li","year":"2021","journal-title":"Data Min. Knowl. Discovery"}],"container-title":["Journal of Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037704272600186X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037704272600186X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T00:34:39Z","timestamp":1780014879000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037704272600186X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":27,"alternative-id":["S037704272600186X"],"URL":"https:\/\/doi.org\/10.1016\/j.cam.2026.117526","relation":{},"ISSN":["0377-0427"],"issn-type":[{"value":"0377-0427","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A novel subspace-minimization conjugate gradient algorithm with non-monotone line search for solving large scale unconstrained optimization problems","name":"articletitle","label":"Article Title"},{"value":"Journal of Computational and Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cam.2026.117526","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"117526"}}