{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T14:51:09Z","timestamp":1782485469952,"version":"3.54.5"},"reference-count":46,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LQ23A010020"],"award-info":[{"award-number":["LQ23A010020"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LY24A010007"],"award-info":[{"award-number":["LY24A010007"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12301409"],"award-info":[{"award-number":["12301409"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271485"],"award-info":[{"award-number":["12271485"]}],"id":[{"id":"10.13039\/501100001809","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,12]]},"DOI":"10.1016\/j.cam.2026.117824","type":"journal-article","created":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T23:44:15Z","timestamp":1779925455000},"page":"117824","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Complexity guarantees of a class of three-term conjugate gradient algorithms for large-scale non-convex problems and applications"],"prefix":"10.1016","volume":"488","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6926-1765","authenticated-orcid":false,"given":"Xiaoliang","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.cam.2026.117824_bib0001","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10589-014-9656-x","article-title":"A regularized Newton method without line search for unconstrained optimization","volume":"59","author":"Ueda","year":"2014","journal-title":"Comput. Optim. Appl."},{"issue":"5","key":"10.1016\/j.cam.2026.117824_bib0002","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/j.orl.2008.02.006","article-title":"A Levenberg-Marquardt algorithm for unconstrained multicriteria optimization","volume":"36","author":"Fischer","year":"2008","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.cam.2026.117824_bib0003","first-page":"621","article-title":"Multivariate spectral gradient method for unconstrained optimization","volume":"201","author":"Han","year":"2008","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"10.1016\/j.cam.2026.117824_bib0004","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","article-title":"Function minimization by conjugate gradients","volume":"7","author":"Fletcher","year":"1964","journal-title":"Comput. J."},{"issue":"6","key":"10.1016\/j.cam.2026.117824_bib0005","doi-asserted-by":"crossref","first-page":"409","DOI":"10.6028\/jres.049.044","article-title":"Methods of conjugate gradients for solving linear systems","volume":"49","author":"Hestenes","year":"1952","journal-title":"J. Res. Natl. Bur. Stand."},{"issue":"4","key":"10.1016\/j.cam.2026.117824_bib0006","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","article-title":"The conjugate gradient method in extreme problems","volume":"9","author":"Polak","year":"1969","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"3","key":"10.1016\/j.cam.2026.117824_bib0007","first-page":"35","article-title":"Note sur la convergence de m\u00e9thodes de directions conjugu\u00e9es","volume":"16","author":"Polak","year":"1969","journal-title":"Rev. Fran\u00e7aise Informat. Recherche Op\u00e9rationnelle"},{"issue":"1","key":"10.1016\/j.cam.2026.117824_bib0008","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s002450010019","article-title":"New conjugacy conditions and related nonlinear conjugate gradient methods","volume":"43","author":"Dai","year":"2001","journal-title":"Appl. Math. Optim."},{"issue":"22","key":"10.1016\/j.cam.2026.117824_bib0009","first-page":"11323","article-title":"A new class of nonlinear conjugate gradient coefficients with global convergence properties","volume":"218","author":"Rivaie","year":"2012","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.cam.2026.117824_bib0010","first-page":"1152","article-title":"A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches","volume":"268","author":"Rivaie","year":"2015","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.cam.2026.117824_bib0011","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.117824_bib0012","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1007\/s11075-024-01970-1","article-title":"Some combined techniques of spectral conjugate gradient methods with applications to robotic and image restoration models","volume":"100","author":"Salihu","year":"2025","journal-title":"Numer. Algorithms"},{"key":"10.1016\/j.cam.2026.117824_bib0013","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/j.matcom.2024.07.008","article-title":"An efficient Newton-like conjugate gradient method with restart strategy and its application","volume":"226","author":"Salihu","year":"2024","journal-title":"Math. Comput. Simul."},{"issue":"2","key":"10.1016\/j.cam.2026.117824_bib0014","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1080\/0305215X.2025.2475004","article-title":"An improved Dai-Kou conjugate gradient method with spectral search direction and applications","volume":"58","author":"Salihu","year":"2026","journal-title":"Eng. Optim."},{"issue":"1","key":"10.1016\/j.cam.2026.117824_bib0015","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1051\/ro\/2023196","article-title":"A new family of hybrid conjugate gradient method for unconstrained optimization and its application to regression analysis","volume":"58","author":"Hanachi","year":"2024","journal-title":"RAIRO Oper. Res."},{"issue":"12","key":"10.1016\/j.cam.2026.117824_bib0016","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3390\/math9121353","article-title":"A new hybrid three-term conjugate gradient algorithm for large-scale unconstrained problems","volume":"9","author":"Tian","year":"2021","journal-title":"Mathematics"},{"issue":"4","key":"10.1016\/j.cam.2026.117824_bib0017","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/nla.2482","article-title":"A class of improved conjugate gradient methods for nonconvex unconstrained optimization","volume":"30","author":"Hu","year":"2023","journal-title":"Numer. Linear Algebra Appl."},{"issue":"1","key":"10.1016\/j.cam.2026.117824_bib0018","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s11075-009-9321-0","article-title":"Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization","volume":"54","author":"Andrei","year":"2010","journal-title":"Numer. Algorithms"},{"issue":"4","key":"10.1016\/j.cam.2026.117824_bib0019","doi-asserted-by":"crossref","first-page":"1169","DOI":"10.1007\/s11075-018-0479-1","article-title":"A descent hybrid conjugate gradient method based on the memoryless BFGS update","volume":"79","author":"Livieris","year":"2018","journal-title":"Numer. Algorithms"},{"issue":"4","key":"10.1016\/j.cam.2026.117824_bib0020","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s40314-019-0973-7","article-title":"A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function","volume":"38","author":"Khoshgam","year":"2019","journal-title":"Comput. Appl. Math."},{"key":"10.1016\/j.cam.2026.117824_bib0021","doi-asserted-by":"crossref","DOI":"10.1016\/j.cam.2022.114879","article-title":"An efficient conjugate gradient-based algorithm for unconstrained optimization and its projection extension to large-scale constrained nonlinear equations with application in signal recovery","volume":"422","author":"Wu","year":"2023","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.cam.2026.117824_bib0022","doi-asserted-by":"crossref","DOI":"10.1016\/j.cam.2024.116452","article-title":"Two hybrid conjugate gradient based algorithms on Riemannian manifolds with adaptive restart strategy for nonconvex optimization problems","volume":"461","author":"Jiang","year":"2025","journal-title":"J. Comput. Appl. Math."},{"issue":"6","key":"10.1016\/j.cam.2026.117824_bib0023","first-page":"1073","article-title":"A modified conjugate gradient algorithm","volume":"26","author":"Perry","year":"1978","journal-title":"Oper. Res. Tech. Notes"},{"issue":"1","key":"10.1016\/j.cam.2026.117824_bib0024","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."},{"issue":"3","key":"10.1016\/j.cam.2026.117824_bib0025","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1007\/s11075-022-01448-y","article-title":"A class of new three-term descent conjugate gradient algorithms for large-scale unconstrained optimization and applications to image restoration problems","volume":"93","author":"Wang","year":"2022","journal-title":"Numer. Algorithms"},{"issue":"3","key":"10.1016\/j.cam.2026.117824_bib0026","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1016\/j.ejor.2013.11.012","article-title":"The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices","volume":"234","author":"Babaie-Kafaki","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cam.2026.117824_bib0027","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1007\/s11075-017-0362-5","article-title":"Dai-Liao conjugate gradient algorithm with clustering of eigenvalues","volume":"77","author":"Dai-Liao","year":"2018","journal-title":"Numer. Algorithms"},{"issue":"1","key":"10.1016\/j.cam.2026.117824_bib0028","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1137\/080743573","article-title":"A three-term conjugate gradient method with sufficient descent property for unconstrained optimization","volume":"21","author":"Narushima","year":"2011","journal-title":"SIAM J. Optim."},{"issue":"1","key":"10.1016\/j.cam.2026.117824_bib0029","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s10107-019-01362-7","article-title":"A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization","volume":"180","author":"Royer","year":"2020","journal-title":"Math. Program."},{"key":"10.1016\/j.cam.2026.117824_bib0030","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.apnum.2023.08.006","article-title":"A truncated three-term conjugate gradient method with complexity guarantees with applications to nonconvex regression problem","volume":"194","author":"Hu","year":"2023","journal-title":"Appl. Numer. Math."},{"issue":"1","key":"10.1016\/j.cam.2026.117824_bib0031","article-title":"A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression","volume":"10","author":"Chan-Renous","year":"2022","journal-title":"EURO J. Comput. Optim."},{"key":"10.1016\/j.cam.2026.117824_bib0032","unstructured":"S. Karimi, S. Vavasis, Nonlinear conjugate gradient for smooth convex functions, 2021. arXiv: 2111.11613 [math.OC]."},{"issue":"2","key":"10.1016\/j.cam.2026.117824_bib0033","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1080\/01630563.2018.1535506","article-title":"A new Dai-Liao conjugate gradient method with optimal parameter choice","volume":"40","author":"Zhang","year":"2018","journal-title":"Numer. Funct. Anal. Optim."},{"key":"10.1016\/j.cam.2026.117824_bib0034","doi-asserted-by":"crossref","DOI":"10.1016\/j.cam.2023.115454","article-title":"An accelerated descent CG algorithm with clustering the eigenvalues for large-scale nonconvex unconstrained optimization and its applications","volume":"437","author":"Wang","year":"2024","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.cam.2026.117824_bib0035","series-title":"Problem Complexity and Method Efficiency in Optimization","author":"Nemirovski","year":"1983"},{"issue":"1","key":"10.1016\/j.cam.2026.117824_bib0036","first-page":"147","article-title":"An unconstrained optimization test functions collection","volume":"10","author":"Andrei","year":"2008","journal-title":"Adv. Model. Optim."},{"issue":"2","key":"10.1016\/j.cam.2026.117824_bib0037","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.117824_bib0038","series-title":"Fundamentals of Matrix Computations","author":"Watkins","year":"2002"},{"issue":"8","key":"10.1016\/j.cam.2026.117824_bib0039","doi-asserted-by":"crossref","first-page":"1595","DOI":"10.1080\/00207160.2018.1465940","article-title":"A hybrid scaling parameter for the scaled memoryless BFGS method based on the \u2113\u221e matrix norm","volume":"96","author":"Babaie-Kafaki","year":"2019","journal-title":"Int. J. Comput. Math."},{"key":"10.1016\/j.cam.2026.117824_bib0040","doi-asserted-by":"crossref","DOI":"10.1016\/j.cam.2022.114630","article-title":"Global convergence of a modified spectral three-term CG algorithm for nonconvex unconstrained optimization problems","volume":"417","author":"Amini","year":"2023","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"10.1016\/j.cam.2026.117824_bib0041","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1080\/10556788.2016.1225213","article-title":"A new spectral conjugate gradient method for large-scale unconstrained optimization","volume":"32","author":"Jian","year":"2017","journal-title":"Optim. Methods Softw."},{"key":"10.1016\/j.cam.2026.117824_bib0042","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10288-020-00432-3","article-title":"A spectral three-term Hestenes-Stiefel conjugate gradient method","volume":"19","author":"Faramarzi","year":"2021","journal-title":"4OR-Q. J. Oper. Res."},{"key":"10.1016\/j.cam.2026.117824_bib0043","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.117824_bib0044","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/j.apnum.2019.12.026","article-title":"A class of globally convergent three-term Dai-Liao conjugate gradient methods","volume":"151","author":"Yao","year":"2020","journal-title":"Appl. Numer. Math."},{"issue":"5","key":"10.1016\/j.cam.2026.117824_bib0045","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1016\/j.aml.2010.01.010","article-title":"A descent spectral conjugate gradient method for impulse noise removal","volume":"23","author":"Yu","year":"2010","journal-title":"Appl. Math. Lett."},{"key":"10.1016\/j.cam.2026.117824_bib0046","series-title":"Handbook of Image and Video Processing","author":"Bovik","year":"2000"}],"container-title":["Journal of Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726004668?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726004668?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T14:35:12Z","timestamp":1782484512000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377042726004668"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":46,"alternative-id":["S0377042726004668"],"URL":"https:\/\/doi.org\/10.1016\/j.cam.2026.117824","relation":{},"ISSN":["0377-0427"],"issn-type":[{"value":"0377-0427","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Complexity guarantees of a class of three-term conjugate gradient algorithms for large-scale non-convex problems and applications","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.117824","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":"117824"}}