{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T22:16:46Z","timestamp":1783203406941,"version":"3.54.6"},"reference-count":54,"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,5,31]],"date-time":"2026-05-31T00:00:00Z","timestamp":1780185600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002428","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.117856","type":"journal-article","created":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T05:46:45Z","timestamp":1780292805000},"page":"117856","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Restarting two-term nonlinear conjugate gradient methods based on a finite precision arithmetic analysis"],"prefix":"10.1016","volume":"488","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7973-3770","authenticated-orcid":false,"given":"Morteza","family":"Kimiaei","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saman","family":"Babaie\u2013Kafaki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vyacheslav","family":"Kungurtsev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mahsa","family":"Yousefi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.cam.2026.117856_bib0001","series-title":"Numerical Optimization","author":"Nocedal","year":"1999"},{"key":"10.1016\/j.cam.2026.117856_bib0002","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1023\/A:1012959223138","article-title":"A survey of quasi-Newton equations and quasi-Newton methods for optimization","volume":"103","author":"Xu","year":"2001","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.cam.2026.117856_bib0003","series-title":"Nonlinear Conjugate Gradient Methods for Unconstrained Optimization","author":"Andrei","year":"2020"},{"issue":"1","key":"10.1016\/j.cam.2026.117856_sbref0004","first-page":"35","article-title":"A survey of nonlinear conjugate gradient methods","volume":"2","author":"Hager","year":"2006","journal-title":"Pac. J. Optim."},{"key":"10.1016\/j.cam.2026.117856_bib0005","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":"4","key":"10.1016\/j.cam.2026.117856_bib0006","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1080\/10556788.2018.1457150","article-title":"A modified Hestenes\u2013Stiefel conjugate gradient method with an optimal property","volume":"34","author":"Amini","year":"2019","journal-title":"Optim. Methods Softw."},{"key":"10.1016\/j.cam.2026.117856_bib0007","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10092-019-0312-9","article-title":"A modified descent Polak\u2013Ribi\u00e9re\u2013Polyak conjugate gradient method with global convergence property for nonconvex functions","volume":"56","author":"Aminifard","year":"2019","journal-title":"Calcolo"},{"key":"10.1016\/j.cam.2026.117856_bib0008","doi-asserted-by":"crossref","first-page":"1345","DOI":"10.1007\/s11075-019-00658-1","article-title":"Two-parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length","volume":"82","author":"Babaie\u2013Kafaki","year":"2019","journal-title":"Numer. Algorithms"},{"issue":"8","key":"10.1016\/j.cam.2026.117856_bib0009","doi-asserted-by":"crossref","first-page":"2285","DOI":"10.1007\/s11590-014-0736-8","article-title":"Two modified three-term conjugate gradient methods with sufficient descent property","volume":"8","author":"Babaie\u2013Kafaki","year":"2014","journal-title":"Optim. Lett."},{"issue":"1\u20132","key":"10.1016\/j.cam.2026.117856_bib0010","first-page":"1","article-title":"Nonlinear conjugate gradient methods: worst-case convergence rates via computer-assisted analyses","volume":"213","author":"Das Gupta","year":"2024","journal-title":"Math. Program."},{"issue":"6","key":"10.1016\/j.cam.2026.117856_bib0011","doi-asserted-by":"crossref","first-page":"2173","DOI":"10.2298\/FIL1806173E","article-title":"Extended Dai\u2013Yuan conjugate gradient strategy for large-scale unconstrained optimization with applications to compressive sensing","volume":"32","author":"Esmaeili","year":"2018","journal-title":"Filomat"},{"issue":"2","key":"10.1016\/j.cam.2026.117856_bib0012","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1007\/s10589-025-00741-5","article-title":"A globally convergent gradient method with momentum","volume":"93","author":"Lapucci","year":"2025","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"10.1016\/j.cam.2026.117856_bib0013","doi-asserted-by":"crossref","first-page":"245","DOI":"10.3934\/jimo.2018149","article-title":"A three term Polak\u2013Ribi\u00e8re\u2013Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method","volume":"16","author":"Li","year":"2020","journal-title":"J. Ind. Manag. Optim."},{"issue":"6","key":"10.1016\/j.cam.2026.117856_bib0014","doi-asserted-by":"crossref","first-page":"1216","DOI":"10.1080\/10556788.2024.2339215","article-title":"An active set method for bound-constrained optimization","volume":"39","author":"Neumaier","year":"2024","journal-title":"Optim. Methods Softw."},{"key":"10.1016\/j.cam.2026.117856_bib0015","series-title":"Trust Region Methods","author":"Conn","year":"2000"},{"key":"10.1016\/j.cam.2026.117856_bib0016","series-title":"Modern Numerical Nonlinear Optimization","author":"Andrei","year":"2022"},{"key":"10.1016\/j.cam.2026.117856_bib0017","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1051\/ro\/2022213","article-title":"A survey on the Dai\u2013Liao family of nonlinear conjugate gradient methods","volume":"57","author":"Babaie\u2013Kafaki","year":"2023","journal-title":"RAIRO\u2013Oper. Res."},{"issue":"3","key":"10.1016\/j.cam.2026.117856_bib0018","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1007\/s10957-011-9960-x","article-title":"Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization","volume":"153","author":"Sugiki","year":"2012","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"10.1016\/j.cam.2026.117856_bib0019","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1016\/j.ejor.2009.11.030","article-title":"Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization","volume":"204","author":"Andrei","year":"2010","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cam.2026.117856_bib0020","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1080\/10556788.2017.1325885","article-title":"A modified Hestense\u2013Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method","volume":"33","author":"Li","year":"2017","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"10.1016\/j.cam.2026.117856_bib0021","first-page":"348","article-title":"Convergence properties of nonlinear conjugate gradient methods","volume":"10","author":"Dai","year":"1999","journal-title":"SIAM J. Optim."},{"issue":"3","key":"10.1016\/j.cam.2026.117856_bib0022","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1007\/s10957-018-1377-3","article-title":"An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition","volume":"179","author":"Dong","year":"2018","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"10.1016\/j.cam.2026.117856_bib0023","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1080\/01630563.2010.532273","article-title":"A trust region algorithm with conjugate gradient technique for optimization problems","volume":"32","author":"Yuan","year":"2011","journal-title":"Numer. Funct. Anal. Optim."},{"key":"10.1016\/j.cam.2026.117856_bib0024","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.cam.2017.10.018","article-title":"CGRS-an advanced hybrid method for global optimization of continuous functions closely coupling extended random search and conjugate gradient method","volume":"333","author":"Gnandt","year":"2018","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.cam.2026.117856_bib0025","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.jmgm.2014.01.001","article-title":"Fletcher\u2013Reeves based particle swarm optimization for prediction of molecular structure","volume":"49","author":"Agrawal","year":"2014","journal-title":"J. Mol. Graph. Model."},{"issue":"2","key":"10.1016\/j.cam.2026.117856_sbref0026","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate O(1k2)","volume":"27","author":"Nesterov","year":"1983","journal-title":"Sov. Math. Dokl."},{"issue":"5","key":"10.1016\/j.cam.2026.117856_bib0027","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","article-title":"Some methods of speeding up the convergence of iteration methods","volume":"4","author":"Polyak","year":"1964","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"10.1016\/j.cam.2026.117856_sbref0028","first-page":"2121","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","volume":"12","author":"Duchi","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.cam.2026.117856_sbref0029","article-title":"Adam: a method for stochastic optimization","volume":"abs\/1412.6980","author":"Kingma","year":"2014","journal-title":"CoRR"},{"issue":"4","key":"10.1016\/j.cam.2026.117856_bib0030","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1051\/ro\/2019045","article-title":"A restart scheme for the Dai\u2013Liao conjugate gradient method by ignoring a direction of maximum magnification by the search direction matrix","volume":"54","author":"Aminifard","year":"2020","journal-title":"RAIRO\u2013Oper. Res."},{"key":"10.1016\/j.cam.2026.117856_bib0031","first-page":"45","article-title":"On restart procedures for the conjugate gradient method","volume":"30","author":"Dai","year":"2002","journal-title":"Numer. Algorithms"},{"issue":"5","key":"10.1016\/j.cam.2026.117856_bib0032","doi-asserted-by":"crossref","first-page":"947","DOI":"10.1080\/10556788.2023.2189718","article-title":"Two families of hybrid conjugate gradient methods with restart procedures and their applications","volume":"38","author":"Jiang","year":"2023","journal-title":"Optim. Methods Softw."},{"key":"10.1016\/j.cam.2026.117856_bib0033","series-title":"Encyclopedia of Optimization","first-page":"2453","article-title":"Nonlinear conjugate gradient methods","author":"Dai","year":"2006"},{"issue":"5","key":"10.1016\/j.cam.2026.117856_bib0034","first-page":"1475","article-title":"A new conjugate gradient method with a restart direction and its application","volume":"8","author":"Li","year":"2023","journal-title":"AIMS Math."},{"key":"10.1016\/j.cam.2026.117856_bib0035","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01593790","article-title":"Restart procedures for the conjugate gradient method","volume":"12","author":"Powell","year":"1977","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.cam.2026.117856_bib0036","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":"3","key":"10.1016\/j.cam.2026.117856_bib0037","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/s11075-014-9856-6","article-title":"A hybridization of the Polak\u2013Ribi\u00e8re\u2013Polyak and Fletcher\u2013Reeves conjugate gradient methods","volume":"68","author":"Babaie\u2013Kafaki","year":"2015","journal-title":"Numer. Algorithms"},{"issue":"1","key":"10.1016\/j.cam.2026.117856_bib0038","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1137\/0802003","article-title":"Global convergence properties of conjugate gradient methods for optimization","volume":"2","author":"Gilbert","year":"1992","journal-title":"SIAM J. Optim."},{"issue":"6","key":"10.1016\/j.cam.2026.117856_bib0039","doi-asserted-by":"crossref","first-page":"1445","DOI":"10.1080\/10556788.2024.2364203","article-title":"Two efficient spectral hybrid CG methods based on memoryless BFGS direction and Dai\u2013Liao conjugacy condition","volume":"39","author":"Liu","year":"2024","journal-title":"Optim. Methods Softw."},{"key":"10.1016\/j.cam.2026.117856_bib0040","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/j.apm.2023.01.018","article-title":"Two families of self-adjusting spectral hybrid DL conjugate gradient methods and applications in image denoising","volume":"118","author":"Shao","year":"2023","journal-title":"Appl. Math. Model."},{"key":"10.1016\/j.cam.2026.117856_bib0041","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/j.apnum.2024.06.020","article-title":"An efficient hybrid conjugate gradient method with an adaptive strategy and applications in image restoration problems","volume":"204","author":"Chen","year":"2024","journal-title":"Appl. Numer. Math."},{"key":"10.1016\/j.cam.2026.117856_bib0042","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","article-title":"CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization","volume":"60","author":"Gould","year":"2015","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"10.1016\/j.cam.2026.117856_bib0043","doi-asserted-by":"crossref","first-page":"1607","DOI":"10.1007\/s11075-024-01764-5","article-title":"Globally linearly convergent nonlinear conjugate gradients without Wolfe line search","volume":"97","author":"Neumaier","year":"2024","journal-title":"Numer. Algorithms"},{"key":"10.1016\/j.cam.2026.117856_bib0044","doi-asserted-by":"crossref","DOI":"10.1016\/j.cam.2023.115727","article-title":"A class of CG algorithms overcoming jamming of the iterative solving process and its application in image restoration","volume":"442","author":"Babaie\u2013Kafaki","year":"2024","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"10.1016\/j.cam.2026.117856_bib0045","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."},{"issue":"4","key":"10.1016\/j.cam.2026.117856_bib0046","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/s00211-006-0028-z","article-title":"Global convergence of a modified Fletcher\u2013Reeves conjugate gradient method with Armijo-type line search","volume":"104","author":"Zhang","year":"2006","journal-title":"Numer. Math."},{"issue":"1","key":"10.1016\/j.cam.2026.117856_bib0047","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":"3","key":"10.1016\/j.cam.2026.117856_bib0048","first-page":"2209","article-title":"Two efficient nonlinear conjugate gradient methods with restart","volume":"109","author":"Li","year":"2022","journal-title":"Nonlinear Dyn."},{"issue":"4","key":"10.1016\/j.cam.2026.117856_bib0049","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1147\/rd.164.0431","article-title":"Linear convergence of the conjugate gradient method","volume":"16","author":"Crowder","year":"1972","journal-title":"IBM J. Res. Dev."},{"issue":"2","key":"10.1016\/j.cam.2026.117856_sbref0050","first-page":"319","article-title":"Open problems in conjugate gradient algorithms for unconstrained optimization","volume":"34","author":"Andrei","year":"2011","journal-title":"Bull. Malays. Math. Sci. Soc."},{"issue":"3","key":"10.1016\/j.cam.2026.117856_bib0051","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s12532-024-00261-z","article-title":"Effective matrix adaptation strategy for noisy derivative-free optimization","volume":"16","author":"Kimiaei","year":"2024","journal-title":"Math. Program. Comput."},{"issue":"1","key":"10.1016\/j.cam.2026.117856_bib0052","first-page":"93","article-title":"A new algorithm of nonlinear conjugate gradient method with strong convergence","volume":"27","author":"Shi","year":"2008","journal-title":"Comput. Appl. Math."},{"issue":"3","key":"10.1016\/j.cam.2026.117856_bib0053","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1145\/192115.192132","article-title":"Line search algorithms with guaranteed sufficient decrease","volume":"20","author":"Mor\u00e9","year":"1994","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"10.1016\/j.cam.2026.117856_bib0054","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."}],"container-title":["Journal of Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037704272600498X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037704272600498X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T21:50:04Z","timestamp":1783201804000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037704272600498X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":54,"alternative-id":["S037704272600498X"],"URL":"https:\/\/doi.org\/10.1016\/j.cam.2026.117856","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":"Restarting two-term nonlinear conjugate gradient methods based on a finite precision arithmetic analysis","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.117856","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"117856"}}