{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T14:13:13Z","timestamp":1780495993587,"version":"3.54.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,6,19]],"date-time":"2021-06-19T00:00:00Z","timestamp":1624060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,19]],"date-time":"2021-06-19T00:00:00Z","timestamp":1624060800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771383"],"award-info":[{"award-number":["11771383"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004607","name":"Natural Science Foundation of Guangxi Province","doi-asserted-by":"publisher","award":["2020GXNSFDA238017"],"award-info":[{"award-number":["2020GXNSFDA238017"]}],"id":[{"id":"10.13039\/501100004607","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Project of Guangxi University for Nationalities","award":["2018KJQD02"],"award-info":[{"award-number":["2018KJQD02"]}]},{"name":"Innovation Project of Guangxi Graduate Education","award":["gxun-chxzs2019034"],"award-info":[{"award-number":["gxun-chxzs2019034"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s40314-021-01557-9","type":"journal-article","created":{"date-parts":[[2021,6,19]],"date-time":"2021-06-19T19:02:31Z","timestamp":1624129351000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["An improved Polak\u2013Ribi\u00e8re\u2013Polyak conjugate gradient method with an efficient restart direction"],"prefix":"10.1007","volume":"40","author":[{"given":"Xianzhen","family":"Jiang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8048-7397","authenticated-orcid":false,"given":"Jinbao","family":"Jian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dan","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pengjie","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,6,19]]},"reference":[{"issue":"1","key":"1557_CR1","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":"1557_CR2","doi-asserted-by":"crossref","unstructured":"Andrei N (2009) Hybrid conjugate gradient algorithm for unconstrained optimization. J Optim Theory Appl 141:249\u2013264","DOI":"10.1007\/s10957-008-9505-0"},{"issue":"1","key":"1557_CR3","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s11075-009-9318-8","volume":"53","author":"WY Cheng","year":"2010","unstructured":"Cheng WY, Liu QF (2010) Sufficient descent nonlinear conjugate gradient methods with condition. Numer Algor 53(1):113\u2013131","journal-title":"Numer Algor"},{"issue":"1","key":"1557_CR4","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(1):296\u2013320","journal-title":"SIAM J Optim"},{"issue":"14","key":"1557_CR5","doi-asserted-by":"crossref","first-page":"7421","DOI":"10.1016\/j.amc.2011.12.091","volume":"218","author":"ZF Dai","year":"2012","unstructured":"Dai ZF, Wen FH (2012) Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property. Appl Math Comput 218(14):7421\u20137430","journal-title":"Appl Math Comput"},{"issue":"1","key":"1557_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"YH Dai","year":"1999","unstructured":"Dai YH, Yuan YX (1999) A nonlinear conjugate gradient method with a strong global convergence property. SIAM J Optim 10(1):177\u2013182","journal-title":"SIAM J Optim"},{"key":"1557_CR7","volume-title":"Nonlinear conjugate gradient methods","author":"YH Dai","year":"2000","unstructured":"Dai YH, Yuan YX (2000) Nonlinear conjugate gradient methods. Shanghai Scientific and Technical Publishers, Shanghai"},{"key":"1557_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan ED, Mor\u00e9 J (2002) Benchmarking optimization software with performance profiles. Math Program 91:201\u2013213","journal-title":"Math Program"},{"key":"1557_CR9","doi-asserted-by":"crossref","unstructured":"Dong XL, Han DR, Dai ZF, Li LX, Zhu JG (2018) An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition. J Optim Theory Appl 179:944\u2013961","DOI":"10.1007\/s10957-018-1377-3"},{"key":"1557_CR10","doi-asserted-by":"crossref","unstructured":"Fatemi M (2016a) A new efficient conjugate gradient method for unconstrained optimization. J Comput Appl Math 300:207\u2013216","DOI":"10.1016\/j.cam.2015.12.035"},{"key":"1557_CR11","doi-asserted-by":"crossref","unstructured":"Fatemi M (2016b) An optimal parameter for Dai-Liao family of conjugate gradient methods. J Optim Theory Appl 169(2):587\u2013605","DOI":"10.1007\/s10957-015-0786-9"},{"issue":"5","key":"1557_CR12","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1080\/10556788.2016.1233971","volume":"32","author":"M Fatemi","year":"2017","unstructured":"Fatemi M (2017) A scaled conjugate gradient method for nonlinear unconstrained optimization. Optim Methods Soft 32(5):1095\u20131112","journal-title":"Optim Methods Soft"},{"issue":"2","key":"1557_CR13","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(2):149\u2013154","journal-title":"Comput J"},{"issue":"1","key":"1557_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1137\/0802003","volume":"2","author":"JC Gilbert","year":"1992","unstructured":"Gilbert JC, Nocedal J (1992) Global convergence properties of conjugate gradient methods for optimization. SIAM J Optim 2(1):21\u201342","journal-title":"SIAM J Optim"},{"issue":"4","key":"1557_CR15","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"NIM Gould","year":"2003","unstructured":"Gould NIM, Orban D, Toint PL (2003) CUTEr and SifDec: a constrained and unconstrained testing environment, revisited. ACM Trans Math Soft (TOMS) 29(4):373\u2013394","journal-title":"ACM Trans Math Soft (TOMS)"},{"issue":"1","key":"1557_CR16","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/030601880","volume":"16","author":"WW Hager","year":"2005","unstructured":"Hager WW, Zhang HC (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"},{"issue":"4","key":"1557_CR17","doi-asserted-by":"publisher","first-page":"2150","DOI":"10.1137\/120898097","volume":"23","author":"WW Hager","year":"2013","unstructured":"Hager WW, Zhang HC (2013) The limited memory conjugate gradient method. SIAM J Optim 23(4):2150\u20132168","journal-title":"SIAM J Optim"},{"issue":"6","key":"1557_CR18","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 equations. J Res Natl Bur Stand 49(6):409\u2013436","journal-title":"J Res Natl Bur Stand"},{"issue":"3\u20134","key":"1557_CR19","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1016\/j.apm.2014.08.008","volume":"39","author":"JB Jian","year":"2015","unstructured":"Jian JB, Han L, Jiang XZ (2015) A hybrid conjugate gradient method with descent property for unconstrained optimization. Appl Math Model 39(3\u20134):1281\u20131290","journal-title":"Appl Math Model"},{"key":"1557_CR20","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/j.cam.2018.09.012","volume":"348","author":"XZ Jiang","year":"2019","unstructured":"Jiang XZ, Jian JB (2019) Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search. J Comput Appl Math 348:525\u2013534","journal-title":"J Comput Appl Math"},{"issue":"186","key":"1557_CR21","first-page":"1","volume":"38","author":"Z Khoshgam","year":"2019","unstructured":"Khoshgam Z, Ashrafi A (2019) A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function. Comput Appl Math 38(186):1\u201314","journal-title":"Comput Appl Math"},{"key":"1557_CR22","doi-asserted-by":"crossref","unstructured":"Kou CX, Dai YH (2015) A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization. J Optim Theory Appl 165(1):209\u2013224","DOI":"10.1007\/s10957-014-0528-4"},{"key":"1557_CR23","doi-asserted-by":"crossref","unstructured":"Liu JK, Feng YM, Zou LM (2019) A spectral conjugate gradient method for solving large-scale unconstrained optimization. Comput Math Appl 77(3):731\u2013739","DOI":"10.1016\/j.camwa.2018.10.002"},{"key":"1557_CR24","doi-asserted-by":"crossref","unstructured":"Mor\u00e9 J, Garbow BS, Hillstrome KE (1981) Testing unconstrained optimization software. ACM Trans Math Softw 7:17\u201341","DOI":"10.1145\/355934.355936"},{"key":"1557_CR25","doi-asserted-by":"crossref","unstructured":"Polak B, Ribi\u00e8re G (1969) Note surla convergence des methodes de directions conjugees. Rev Fr Inf Rech Oper 3(1):35\u201343","DOI":"10.1051\/m2an\/196903R100351"},{"key":"1557_CR26","doi-asserted-by":"crossref","unstructured":"Powell MJD (1984) Nonconvex minimization calculations and the conjugate gradient method, lecture note in mathematics, vol 1066. Springer, Berlin","DOI":"10.1007\/BFb0099521"},{"key":"1557_CR27","doi-asserted-by":"crossref","unstructured":"Saman BK, Ghanbari R (2014) Two modified three-term conjugate gradient methods with sufficient descent property. Optim Lett 8(8):2285\u20132297","DOI":"10.1007\/s11590-014-0736-8"},{"issue":"15","key":"1557_CR28","doi-asserted-by":"crossref","first-page":"125004","DOI":"10.1016\/j.amc.2019.125004","volume":"373","author":"ZB Zhu","year":"2020","unstructured":"Zhu ZB, Zhang DD, Wang S (2020) Two modified DY conjugate gradient methods for unconstrained optimization problems. Appl Math Comput 373(15):125004","journal-title":"Appl Math Comput"},{"key":"1557_CR29","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. North-Holland, Amsterdam, pp 37\u201386"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01557-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-021-01557-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01557-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,5]],"date-time":"2023-11-05T03:56:05Z","timestamp":1699156565000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-021-01557-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,19]]},"references-count":29,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["1557"],"URL":"https:\/\/doi.org\/10.1007\/s40314-021-01557-9","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,19]]},"assertion":[{"value":"10 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"174"}}