{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T06:57:59Z","timestamp":1769842679324,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,2,24]],"date-time":"2020-02-24T00:00:00Z","timestamp":1582502400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,24]],"date-time":"2020-02-24T00:00:00Z","timestamp":1582502400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s10288-020-00432-3","type":"journal-article","created":{"date-parts":[[2020,2,24]],"date-time":"2020-02-24T12:06:58Z","timestamp":1582546018000},"page":"71-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["A spectral three-term Hestenes\u2013Stiefel conjugate gradient method"],"prefix":"10.1007","volume":"19","author":[{"given":"Parvaneh","family":"Faramarzi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9264-3091","authenticated-orcid":false,"given":"Keyvan","family":"Amini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,24]]},"reference":[{"key":"432_CR1","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1016\/j.aml.2006.06.015","volume":"20","author":"N Andrei","year":"2007","unstructured":"Andrei N (2007) A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization. Appl Math Lett 20:645\u2013650","journal-title":"Appl Math Lett"},{"issue":"1","key":"432_CR2","first-page":"147","volume":"10","author":"N Andrei","year":"2008","unstructured":"Andrei N (2008) An unconstrained optimization test functions collection. Adv Model Optim 10(1):147\u2013161","journal-title":"Adv Model Optim"},{"key":"432_CR3","doi-asserted-by":"publisher","first-page":"3397","DOI":"10.1016\/j.cam.2010.05.002","volume":"234","author":"N Andrei","year":"2010","unstructured":"Andrei N (2010) New accelerated conjugate gradient algorithms as a modification of Dai\u2013Yuan\u2019s computational scheme for unconstrained optimization. J Comput Appl Math 234:3397\u20133410","journal-title":"J Comput Appl Math"},{"issue":"4","key":"432_CR4","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1080\/10556788.2018.1457150","volume":"34","author":"K Amini","year":"2019","unstructured":"Amini K, Faramarzi P, Pirfalah N (2019) A modified Hestenes\u2013Stiefel conjugate gradient method with an optimal property. Optim Methods Softw 34(4):770\u2013782","journal-title":"Optim Methods Softw"},{"key":"432_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-018-0387-1","author":"Z Aminifard","year":"2018","unstructured":"Aminifard Z, Babaie-Kafaki S (2018) An optimal parameter choice for the Dai-Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix, 4OR Q. J Oper Res. https:\/\/doi.org\/10.1007\/s10288-018-0387-1","journal-title":"J Oper Res"},{"issue":"1","key":"432_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10288-016-0323-1","volume":"15","author":"S Babaie-Kafaki","year":"2017","unstructured":"Babaie-Kafaki S, Ghanbari R (2017) A class of adaptive Dai\u2013Liao conjugate gradient methods based on the scaled memoryless BFGS update, 4OR Q. J Oper Res 15(1):85\u201392","journal-title":"J Oper Res"},{"issue":"1","key":"432_CR7","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai J, Borwein JM (1988) Two-point step size gradient methods. IMA J Numer Anal 8(1):141\u2013148","journal-title":"IMA J Numer Anal"},{"key":"432_CR8","unstructured":"Beale EML (1972) A derivation of conjugate gradients. In: Lootsma FA (ed) Numerwal methods\/or nonhnear optimization. Academic Press, NewYork, pp 39\u201343"},{"key":"432_CR9","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s00245-001-0003-0","volume":"43","author":"EG Birgin","year":"2001","unstructured":"Birgin EG, Mart\u00ednez JM (2001) A spectral conjugate gradient method for unconstrained optimization. Appl Math Optim 43:117\u2013128","journal-title":"Appl Math Optim"},{"key":"432_CR10","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/200979.201043","volume":"21","author":"I Bongartz","year":"1995","unstructured":"Bongartz I, Conn AR, Gould NIM, Toint PL (1995) CUTE: constrained and unconstrained testing environments. ACM Trans Math Softw 21:123\u2013160","journal-title":"ACM Trans Math Softw"},{"key":"432_CR11","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/100813026","volume":"23","author":"YH Dai","year":"2013","unstructured":"Dai YH, Kou CX (2013) A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search. SIAM J Optim 23:296\u2013320","journal-title":"SIAM J Optim"},{"key":"432_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan ED, Mor\u00e9 JJ (2002) Benchmarking optimization software with performance profiles. Math Program 91:201\u2013213","journal-title":"Math Program"},{"issue":"2","key":"432_CR13","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/s10957-019-01527-6","volume":"182","author":"P Faramarzi","year":"2019","unstructured":"Faramarzi P, Amini K (2019) A modified spectral conjugate gradient method with global convergence. J Optim Theory Appl 182(2):667\u2013690","journal-title":"J Optim Theory Appl"},{"key":"432_CR14","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"7","author":"R Fletcher","year":"1964","unstructured":"Fletcher R, Reeves CM (1964) Function minimization by conjugate gradients. Comput J 7:149\u2013154","journal-title":"Comput J"},{"issue":"1","key":"432_CR15","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/030601880","volume":"16","author":"WW Hager","year":"2005","unstructured":"Hager WW, Zhang H (2005) A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J Optim 16(1):170\u2013192","journal-title":"SIAM J Optim"},{"key":"432_CR16","doi-asserted-by":"publisher","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"MR Hestenes","year":"1952","unstructured":"Hestenes MR, Stiefel E (1952) Method of conjugate gradient for solving linear system. J Res Nat Bur Stand 49:409\u2013436","journal-title":"J Res Nat Bur Stand"},{"issue":"3","key":"432_CR17","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1080\/10556788.2016.1225213","volume":"32","author":"J Jian","year":"2017","unstructured":"Jian J, Chen Q, Jiang X, Zeng Y, Yin J (2017) A new spectral conjugate gradient method for large-scale unconstrained optimization. Optim Methods Softw 32(3):503\u2013515","journal-title":"Optim Methods Softw"},{"key":"432_CR18","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/j.cam.2018.09.012","volume":"328","author":"XZ Jiang","year":"2019","unstructured":"Jiang XZ, Jian JB (2019) Improved Fletcher\u2013Reeves and Dai\u2013Yuan conjugate gradient methods with the strong Wolfe line search. J Comput Appl Math 328:525\u2013534","journal-title":"J Comput Appl Math"},{"issue":"1","key":"432_CR19","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10957-014-0528-4","volume":"165","author":"CX Kou","year":"2015","unstructured":"Kou CX, Dai YH (2015) A modified self-scaling memoryless Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno method for unconstrained optimization. J Optim Theory Appl 165(1):209\u2013224","journal-title":"J Optim Theory Appl"},{"issue":"1\u20132","key":"432_CR20","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0377-0427(00)00540-9","volume":"129","author":"DH Li","year":"2001","unstructured":"Li DH, Fukushima M (2001) A modified BFGS method and its global convergence in non-convex minimization. J Comput Appl Math 129(1\u20132):15\u201335","journal-title":"J Comput Appl Math"},{"key":"432_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2018.10.035","author":"X Li","year":"2018","unstructured":"Li X, Shi J, Dong X, Yu J (2018) A new conjugate gradient method based on Quasi\u2013Newton equation for unconstrained optimization. J Comput Appl Math. https:\/\/doi.org\/10.1016\/j.cam.2018.10.035","journal-title":"J Comput Appl Math"},{"key":"432_CR22","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF00933447","volume":"23","author":"JL Nazareth","year":"1977","unstructured":"Nazareth JL (1977) Conjugate direction algorithm without line searches. J Optim Theory Appl 23:373\u2013387","journal-title":"J Optim Theory Appl"},{"key":"432_CR23","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1137\/080743573","volume":"21","author":"Y Narushima","year":"2011","unstructured":"Narushima Y, Yabe H, Ford JA (2011) A three-term conjugate gradient method with sufficient descent property for unconstrained optimization. SIAM J Optim 21:212\u2013230","journal-title":"SIAM J Optim"},{"key":"432_CR24","volume-title":"Numerical optimization. Springer series in operation Research","author":"J Nocedal","year":"1999","unstructured":"Nocedal J, Wright SJ (1999) Numerical optimization. Springer series in operation Research. Springer, New York"},{"key":"432_CR25","first-page":"35","volume":"16","author":"E Polak","year":"1969","unstructured":"Polak E, Ribi\u00e9re G (1969) Note sur la convergence de methods de directions conjugees. Rev Fr Inform Rech Oper 16:35\u201343","journal-title":"Rev Fr Inform Rech Oper"},{"key":"432_CR26","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","volume":"9","author":"BT Polyak","year":"1969","unstructured":"Polyak BT (1969) The conjugate gradient method in extreme problems. USSR Comput Math Math Phys 9:94\u2013112","journal-title":"USSR Comput Math Math Phys"},{"key":"432_CR27","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1137\/S1052623494266365","volume":"7","author":"M Raydan","year":"1997","unstructured":"Raydan M (1997) The Barzilain and Borwein gradient method for the large scale unconstrained minimization problem. SIAM J Optim 7:26\u201333","journal-title":"SIAM J Optim"},{"issue":"2","key":"432_CR28","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1080\/10556780701661344","volume":"23","author":"GH Yu","year":"2008","unstructured":"Yu GH, Guan LT, Chen WF (2008) Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization. Optim Methods Softw 23(2):275\u2013293","journal-title":"Optim Methods Softw"},{"key":"432_CR29","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1093\/imanum\/drl016","volume":"26","author":"L Zhang","year":"2006","unstructured":"Zhang L, Zhou W, Li D (2006) A descent modified Polak\u2013Ribi\u00e9re\u2013Polyak conjugate gradient method and its global convergence. IMA J Numer Anal 26:629\u2013640","journal-title":"IMA J Numer Anal"},{"key":"432_CR30","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s00211-006-0028-z","volume":"104","author":"L Zhang","year":"2006","unstructured":"Zhang L, Zhou W, Li D (2006) Global convergence of a modified Fletcher\u2013Reeves conjugate gradient method with Armijo-type line search. Numer Math 104:561\u2013572","journal-title":"Numer Math"},{"key":"432_CR31","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1080\/10556780701223293","volume":"22","author":"L Zhang","year":"2007","unstructured":"Zhang L, Zhou W, Li D (2007) Some descent three-term conjugate gradient methods and their global convergence. Optim Methods Softw 22:697\u2013711","journal-title":"Optim Methods Softw"},{"issue":"5","key":"432_CR32","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1080\/10556780500137041","volume":"21","author":"W Zhou","year":"2006","unstructured":"Zhou W, Zhang L (2006) A nonlinear conjugate gradient method based on the MBFGS secant condition. Optim Methods Softw 21(5):707\u2013714","journal-title":"Optim Methods Softw"},{"key":"432_CR33","first-page":"37","volume-title":"Integer and nonlinear programming","author":"G Zoutendijk","year":"1970","unstructured":"Zoutendijk G (1970) Nonlinear programming, computational methods. In: Abadie J (ed) Integer and nonlinear programming. Amsterdam, North-holland, pp 37\u201386"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-020-00432-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-020-00432-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-020-00432-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,24]],"date-time":"2021-03-24T10:04:34Z","timestamp":1616580274000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-020-00432-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,24]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["432"],"URL":"https:\/\/doi.org\/10.1007\/s10288-020-00432-3","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,24]]},"assertion":[{"value":"2 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}