{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T16:51:05Z","timestamp":1773075065896,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T00:00:00Z","timestamp":1634601600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T00:00:00Z","timestamp":1634601600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s40314-021-01662-9","type":"journal-article","created":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T07:09:17Z","timestamp":1634627357000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A new descent spectral Polak\u2013Ribi\u00e8re\u2013Polyak method based on the memoryless BFGS update"],"prefix":"10.1007","volume":"40","author":[{"given":"Maryam","family":"Khoshsimaye-Bargard","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2238-8363","authenticated-orcid":false,"given":"Ali","family":"Ashrafi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,19]]},"reference":[{"issue":"2","key":"1662_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10092-019-0312-9","volume":"56","author":"Z Aminifard","year":"2019","unstructured":"Aminifard Z, Babaie-Kafaki S (2019) A modified descent Polak-Ribi\u00e8re\u2013Polyak conjugate gradient method with global convergence property for nonconvex functions. Calcolo 56(2):1\u201311","journal-title":"Calcolo"},{"issue":"12","key":"1662_CR2","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.1080\/02331931003653187","volume":"60","author":"N Andrei","year":"2011","unstructured":"Andrei N (2011) A modified Polak\u2013Ribi\u00e8re\u2013Polyak conjugate gradient algorithm for unconstrained optimization. Optimization 60(12):1457\u20131471","journal-title":"Optimization"},{"key":"1662_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-42950-8","volume-title":"Nonlinear conjugate gradient methods for unconstrained optimization","author":"N Andrei","year":"2020","unstructured":"Andrei N (2020) Nonlinear conjugate gradient methods for unconstrained optimization. Springer, Berlin"},{"issue":"9","key":"1662_CR4","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1080\/01630563.2017.1320673","volume":"38","author":"S Babaie-Kafaki","year":"2017","unstructured":"Babaie-Kafaki S, Ghanbari R (2017) An optimal extension of the Polak\u2013Ribi\u00e8re\u2013Polyak conjugate gradient method. Numer Funct Anal Optim 38(9):1115\u20131124","journal-title":"Numer Funct Anal Optim"},{"issue":"1","key":"1662_CR5","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"},{"issue":"2","key":"1662_CR6","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(2):117\u2013128","journal-title":"Appl Math Optim"},{"issue":"11\u201312","key":"1662_CR7","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1080\/01630560701749524","volume":"28","author":"W Cheng","year":"2007","unstructured":"Cheng W (2007) A two-term PRP-based descent method. Numer Funct Anal Optim 28(11\u201312):1217\u20131230","journal-title":"Numer Funct Anal Optim"},{"key":"1662_CR8","unstructured":"Dai YH (1997) Analyses of conjugate gradient methods. Ph.D. Thesis, Institute of Computational Mathematics and Scientific\/Engineering Computing, Chinese Academy of Sciences"},{"issue":"1","key":"1662_CR9","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"},{"issue":"2","key":"1662_CR10","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(2):201\u2013213","journal-title":"Math Program"},{"issue":"2","key":"1662_CR11","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":"1662_CR12","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":"1662_CR13","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 PhL (2003) CUTEr: a constrained and unconstrained testing environment, revisited. ACM Trans Math Softw 29(4):373\u2013394","journal-title":"ACM Trans Math Softw"},{"issue":"1","key":"1662_CR14","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"},{"issue":"6","key":"1662_CR15","doi-asserted-by":"publisher","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"MR Hestenes","year":"1952","unstructured":"Hestenes MR, Stiefel EL (1952) Methods of conjugate gradients for solving linear systems. J Res Nat Bur Stand 49(6):409\u2013436","journal-title":"J Res Nat Bur Stand"},{"issue":"3","key":"1662_CR16","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1080\/10556788.2016.1225213","volume":"23","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 23(3):503\u2013515","journal-title":"Optim Methods Softw"},{"issue":"1","key":"1662_CR17","doi-asserted-by":"crossref","first-page":"245","DOI":"10.3934\/jimo.2018149","volume":"16","author":"M Li","year":"2020","unstructured":"Li M (2020) A three term Polak\u2013Ribi\u00e8re\u2013Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method. J Ind Manage Optim 16(1):245\u2013260","journal-title":"J Ind Manage Optim"},{"key":"1662_CR18","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1016\/j.cam.2018.10.035","volume":"350","author":"X Li","year":"2019","unstructured":"Li X, Shi J, Dong X, Yu J (2019) A new conjugate gradient method based on Quasi-Newton equation for unconstrained optimization. J Comput Appl Math 350:372\u2013379","journal-title":"J Comput Appl Math"},{"issue":"3","key":"1662_CR19","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1145\/192115.192132","volume":"20","author":"JJ Mor\u00e9","year":"1994","unstructured":"Mor\u00e9 JJ, Thuente DJ (1994) Line search algorithms with guaranteed sufficient decrease. ACM Trans Math Softw 20(3):286\u2013307","journal-title":"ACM Trans Math Softw"},{"key":"1662_CR20","volume-title":"Numerical optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal J, Wright SJ (2006) Numerical optimization. Springer, New York"},{"key":"1662_CR21","doi-asserted-by":"crossref","unstructured":"Oren SS (1972) Self-scaling variable metric algorithms for unconstrained minimization. Ph.D. Thesis, Stanford University, California, Department of Engineering Economic Systems","DOI":"10.2307\/2005523"},{"issue":"5","key":"1662_CR22","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1287\/mnsc.20.5.845","volume":"20","author":"SS Oren","year":"1974","unstructured":"Oren SS, Luenberger DG (1974) Self-scaling variable metric (SSVM) algorithms: Part I: criteria and sufficient conditions for scaling a class of algorithms. Manage Sci 20(5):845\u2013862","journal-title":"Manage Sci"},{"issue":"1","key":"1662_CR23","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/BF01580654","volume":"10","author":"SS Oren","year":"1976","unstructured":"Oren SS, Spedicato E (1976) Optimal conditioning of self-scaling variable metric algorithms. Math Program 10(1):70\u201390","journal-title":"Math Program"},{"issue":"16","key":"1662_CR24","first-page":"35","volume":"3","author":"E Polak","year":"1969","unstructured":"Polak E, Ribi\u00e8re G (1969) Note sur la convergence de m\u00e9thods de directions conjugu\u00e9es. Rev Fr Inform Rech Oper 3(16):35\u201343","journal-title":"Rev Fr Inform Rech Oper"},{"issue":"4","key":"1662_CR25","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(4):94\u2013112","journal-title":"USSR Comput Math Math Phys"},{"key":"1662_CR26","series-title":"Lecture notes in mathematics","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/BFb0099521","volume-title":"Numerical analysis (Dundee, 1983)","author":"MJD Powell","year":"1984","unstructured":"Powell MJD (1984) Nonconvex minimization calculations and the conjugate gradient method. Numerical analysis (Dundee, 1983), vol 1066. Lecture notes in mathematics. Springer, Berlin, pp 122\u2013141"},{"issue":"1","key":"1662_CR27","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF01593790","volume":"12","author":"MJD Powell","year":"1977","unstructured":"Powell MJD (1977) Restart procedures for the conjugate gradient method. Math Program 12(1):241\u2013254","journal-title":"Math Program"},{"issue":"1","key":"1662_CR28","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1137\/S1052623494266365","volume":"7","author":"M Raydan","year":"1997","unstructured":"Raydan M (1997) The Barzilai and Borwein gradient method for large scale unconstrained minimization problem. SIAM J Optim 7(1):26\u201333","journal-title":"SIAM J Optim"},{"issue":"1","key":"1662_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1029-242X-2015-1","volume":"2015","author":"M Sun","year":"2015","unstructured":"Sun M, Liu J (2015) Three modified Polak\u2013Ribi\u00e8re\u2013Polyak conjugate gradient methods with sufficient descent property. J Inequal Appl 2015(1):1\u201314","journal-title":"J Inequal Appl"},{"issue":"1","key":"1662_CR30","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.aml.2010.08.002","volume":"24","author":"Z Wan","year":"2011","unstructured":"Wan Z, Yang Z, Wang Y (2011) New spectral PRP conjugate gradient method for unconstrained optimization. Appl Math Lett 24(1):16\u201322","journal-title":"Appl Math Lett"},{"issue":"1","key":"1662_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13660-016-1272-0","volume":"2017","author":"Y Wu","year":"2017","unstructured":"Wu Y (2017) A modified three-term PRP conjugate gradient algorithm for optimization models. J Inequal Appl 2017(1):1\u201314","journal-title":"J Inequal Appl"},{"key":"1662_CR32","doi-asserted-by":"publisher","first-page":"345","DOI":"10.2306\/scienceasia1513-1874.2015.41.345","volume":"41","author":"X Wu","year":"2015","unstructured":"Wu X (2015) A new spectral Polak\u2013Ribi\u00e8re\u2013Polyak conjugate gradient method. ScienceAsia 41:345\u2013349","journal-title":"ScienceAsia"},{"issue":"4","key":"1662_CR33","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\u00e8re-Polyak conjugate gradient method and its global convergence. IMA J Numer Anal 26(4):629\u2013640","journal-title":"IMA J Numer Anal"},{"key":"1662_CR34","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-01662-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-021-01662-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-01662-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T04:43:55Z","timestamp":1725943435000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-021-01662-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,19]]},"references-count":34,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["1662"],"URL":"https:\/\/doi.org\/10.1007\/s40314-021-01662-9","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,19]]},"assertion":[{"value":"27 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"278"}}