{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T03:00:31Z","timestamp":1765422031634},"reference-count":43,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,4,1]],"date-time":"2018-04-01T00:00:00Z","timestamp":1522540800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational and Applied Mathematics"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1016\/j.cam.2017.10.013","type":"journal-article","created":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T15:00:49Z","timestamp":1508857249000},"page":"72-85","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":26,"special_numbering":"C","title":["An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix"],"prefix":"10.1016","volume":"332","author":[{"given":"Shengwei","family":"Yao","sequence":"first","affiliation":[]},{"given":"Liangshuo","family":"Ning","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1\u20132","key":"10.1016\/j.cam.2017.10.013_b1","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10107-013-0686-4","article-title":"Subgradient methods for huge-scale optimization problems","volume":"146","author":"Nesterov","year":"2014","journal-title":"Math. Program."},{"key":"10.1016\/j.cam.2017.10.013_b2","unstructured":"Y. Nesterov, A method of solving a convex programming problem with convergence rate o (1\/k2), 27(2) (1983) 372\u2013376."},{"issue":"1\u20132","key":"10.1016\/j.cam.2017.10.013_b3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10107-012-0541-z","article-title":"Fine tuning Nesterov\u2019s steepest descent algorithm for differentiable convex programming","volume":"138","author":"Gonzaga","year":"2013","journal-title":"Math. Program."},{"issue":"3","key":"10.1016\/j.cam.2017.10.013_b4","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1007\/s10208-013-9150-3","article-title":"Adaptive restart for accelerated gradient schemes","volume":"15","author":"O\u2019Donoghue","year":"2015","journal-title":"Found. Comput. Math."},{"issue":"5","key":"10.1016\/j.cam.2017.10.013_b5","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.2017.10.013_b6","series-title":"Numerical Optimization","author":"Nocedal","year":"2006"},{"key":"10.1016\/j.cam.2017.10.013_b7","series-title":"Optimization Theory and Methods: Nonlinear Programming, Vol. 1","author":"Sun","year":"2006"},{"issue":"2","key":"10.1016\/j.cam.2017.10.013_b8","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1137\/1011036","article-title":"Convergence conditions for ascent methods","volume":"11","author":"Wolfe","year":"1969","journal-title":"SIAM Rev."},{"issue":"2","key":"10.1016\/j.cam.2017.10.013_b9","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1137\/1013035","article-title":"Convergence conditions for ascent methods. II: Some corrections","volume":"13","author":"Wolfe","year":"1971","journal-title":"SIAM Rev."},{"issue":"2","key":"10.1016\/j.cam.2017.10.013_b10","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."},{"key":"10.1016\/j.cam.2017.10.013_b11","series-title":"Methods of conjugate gradients for solving linear systems, Vol. 49","author":"Hestenes","year":"1952"},{"issue":"1","key":"10.1016\/j.cam.2017.10.013_b12","first-page":"35","article-title":"Note sur la convergence de m\u00e9thodes de directions conjugu\u00e9es","volume":"3","author":"Polak","year":"1969","journal-title":"Rev. Fr. Rech. Oper. Ser. Rouge"},{"issue":"4","key":"10.1016\/j.cam.2017.10.013_b13","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","article-title":"The conjugate gradient method in extremal problems","volume":"9","author":"Polyak","year":"1969","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"1","key":"10.1016\/j.cam.2017.10.013_b14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/S1052623497318992","article-title":"A nonlinear conjugate gradient method with a strong global convergence property","volume":"10","author":"Dai","year":"1999","journal-title":"SIAM J. Optim."},{"issue":"1","key":"10.1016\/j.cam.2017.10.013_b15","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":"1","key":"10.1016\/j.cam.2017.10.013_b16","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":"1","key":"10.1016\/j.cam.2017.10.013_b17","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.2017.10.013_b18","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1007\/s11425-013-4682-1","article-title":"An improved nonlinear conjugate gradient method with an optimal property","volume":"57","author":"Kou","year":"2014","journal-title":"Sci. China Math."},{"issue":"1","key":"10.1016\/j.cam.2017.10.013_b19","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0377-0427(00)00540-9","article-title":"A modified bfgs method and its global convergence in nonconvex minimization","volume":"129","author":"Li","year":"2001","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"10.1016\/j.cam.2017.10.013_b20","first-page":"1156","article-title":"New quasi-newton methods for unconstrained optimization problems","volume":"175","author":"Wei","year":"2006","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"10.1016\/j.cam.2017.10.013_b21","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/S0377-0427(00)00713-5","article-title":"Properties and numerical performance of quasi-newton methods with modified quasi-newton equations","volume":"137","author":"Zhang","year":"2001","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"10.1016\/j.cam.2017.10.013_b22","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1016\/j.cam.2006.03.005","article-title":"New conjugacy condition and related new conjugate gradient methods for unconstrained optimization","volume":"202","author":"Li","year":"2007","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"10.1016\/j.cam.2017.10.013_b23","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1023\/B:COAP.0000026885.81997.88","article-title":"Global convergence properties of nonlinear conjugate gradient methods with modified secant condition","volume":"28","author":"Yabe","year":"2004","journal-title":"Comput. Optim. Appl."},{"issue":"5","key":"10.1016\/j.cam.2017.10.013_b24","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1080\/10556780500137041","article-title":"A nonlinear conjugate gradient method based on the mbfgs secant condition","volume":"21","author":"Zhou","year":"2006","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"10.1016\/j.cam.2017.10.013_b25","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1016\/j.ejor.2013.11.012","article-title":"The dai\u2013liao nonlinear conjugate gradient method with optimal parameter choices","volume":"234","author":"Babaie-Kafaki","year":"2014","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cam.2017.10.013_b26","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s10957-015-0786-9","article-title":"An optimal parameter for dai\u2013liao family of conjugate gradient methods","volume":"169","author":"Fatemi","year":"2016","journal-title":"J. Optim. Theory Appl."},{"issue":"11","key":"10.1016\/j.cam.2017.10.013_b27","doi-asserted-by":"crossref","first-page":"2277","DOI":"10.1080\/02331934.2014.938072","article-title":"Two optimal dai\u2013liao conjugate gradient methods","volume":"64","author":"Babaie-Kafaki","year":"2015","journal-title":"Optimization"},{"issue":"6","key":"10.1016\/j.cam.2017.10.013_b28","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1287\/opre.26.6.1073","article-title":"Technical note a modified conjugate gradient algorithm","volume":"26","author":"Perry","year":"1978","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/j.cam.2017.10.013_b29","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1080\/10556788.2013.833199","article-title":"A descent family of dai\u2013liao conjugate gradient methods","volume":"29","author":"Babaie-Kafaki","year":"2014","journal-title":"Optim. Methods Softw."},{"issue":"11","key":"10.1016\/j.cam.2017.10.013_b30","first-page":"6316","article-title":"On three term conjugate gradient algorithms for unconstrained optimization","volume":"219","author":"Andrei","year":"2013","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.cam.2017.10.013_b31","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.cam.2012.10.002","article-title":"A simple three-term conjugate gradient algorithm for unconstrained optimization","volume":"241","author":"Andrei","year":"2013","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"10.1016\/j.cam.2017.10.013_b32","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s11075-014-9845-9","article-title":"A new three-term conjugate gradient algorithm for unconstrained optimization","volume":"68","author":"Andrei","year":"2015","journal-title":"Numer. Algorithms"},{"key":"10.1016\/j.cam.2017.10.013_b33","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.cam.2017.04.045","article-title":"Accelerated adaptive perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update","volume":"325","author":"Andrei","year":"2017","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"10.1016\/j.cam.2017.10.013_b34","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. Programm."},{"issue":"1","key":"10.1016\/j.cam.2017.10.013_b35","first-page":"147","article-title":"An unconstrained optimization test functions collection","volume":"10","author":"Andrei","year":"2008","journal-title":"Adv. Model. Optim."},{"issue":"1","key":"10.1016\/j.cam.2017.10.013_b36","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1093\/imamat\/6.1.76","article-title":"The convergence of a class of double-rank minimization algorithms 1. General considerations","volume":"6","author":"Broyden","year":"1970","journal-title":"IMA J. Appl. Math."},{"issue":"3","key":"10.1016\/j.cam.2017.10.013_b37","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1093\/comjnl\/13.3.317","article-title":"A new approach to variable metric algorithms","volume":"13","author":"Fletcher","year":"1970","journal-title":"Comput. J."},{"issue":"109","key":"10.1016\/j.cam.2017.10.013_b38","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1090\/S0025-5718-1970-0258249-6","article-title":"A family of variable-metric methods derived by variational means","volume":"24","author":"Goldfarb","year":"1970","journal-title":"Math. Comput."},{"issue":"111","key":"10.1016\/j.cam.2017.10.013_b39","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1090\/S0025-5718-1970-0274029-X","article-title":"Conditioning of quasi-newton methods for function minimization","volume":"24","author":"Shanno","year":"1970","journal-title":"Math. Comput."},{"key":"10.1016\/j.cam.2017.10.013_b40","unstructured":"J. Perry, et al., A class of conjugate gradient algorithms with a two-step variable-metric memory, Discussion Papers 269."},{"issue":"6","key":"10.1016\/j.cam.2017.10.013_b41","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1137\/0715085","article-title":"On the convergence of a new conjugate gradient algorithm","volume":"15","author":"Shanno","year":"1978","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"10.1016\/j.cam.2017.10.013_b42","first-page":"37","article-title":"Nonlinear programming, computational methods","volume":"143","author":"Zoutendijk","year":"1970","journal-title":"Integer Nonlinear Programm."},{"issue":"1","key":"10.1016\/j.cam.2017.10.013_b43","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."}],"container-title":["Journal of Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042717305034?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042717305034?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T23:45:44Z","timestamp":1648770344000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377042717305034"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":43,"alternative-id":["S0377042717305034"],"URL":"https:\/\/doi.org\/10.1016\/j.cam.2017.10.013","relation":{},"ISSN":["0377-0427"],"issn-type":[{"value":"0377-0427","type":"print"}],"subject":[],"published":{"date-parts":[[2018,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix","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.2017.10.013","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}