{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T03:02:16Z","timestamp":1765422136627,"version":"3.37.3"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:00:00Z","timestamp":1556755200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s11075-019-00709-7","type":"journal-article","created":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T10:04:09Z","timestamp":1556791449000},"page":"901-933","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization"],"prefix":"10.1007","volume":"83","author":[{"given":"S.","family":"Bojari","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8272-857X","authenticated-orcid":false,"given":"M. R.","family":"Eslahchi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,2]]},"reference":[{"key":"709_CR1","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer Series in Operations Research, Springer, Berlin (2006)","edition":"2nd edn."},{"key":"709_CR2","doi-asserted-by":"publisher","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"MR Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Natl. Bur. Stand. 49, 409\u2013436 (1952)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"709_CR3","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, C.: Function minimization by conjugate gradients. Comput. J. 7, 149\u2013154 (1964)","journal-title":"Comput. J."},{"key":"709_CR4","first-page":"35","volume":"16","author":"E Polak","year":"1969","unstructured":"Polak, E., Ribi\u00e9re, G.: Note sur la convergence de directions conjugu\u00e9es. Francaise Infomat Recherche Operatonelle 16, 35\u201343 (1969)","journal-title":"Francaise Infomat Recherche Operatonelle"},{"key":"709_CR5","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","volume":"9","author":"BT Polyak","year":"1969","unstructured":"Polyak, B.T.: The conjugate gradient method in extreme problems. USSR Comput. Math. Math. Phys. 9, 94\u2013112 (1969)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"709_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"YH Dai","year":"1999","unstructured":"Dai, Y.H., Yuan, Y.: A nonlinear conjugate gradient method with a strong global convergence property. SIAM J. Optim. 10, 177\u2013182 (1999)","journal-title":"SIAM J. Optim."},{"key":"709_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1137\/0802003","volume":"2","author":"JC Gilbert","year":"1992","unstructured":"Gilbert, J.C., Nocedal, J.: Global convergence properties of conjugate gradient methods for optimization. SIAM J. Optim. 2, 21\u201342 (1992)","journal-title":"SIAM J. Optim."},{"key":"709_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s00245-001-0003-0","volume":"43","author":"EG Birgin","year":"2001","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: A spectral conjugate gradient method for unconstrained optimization. Appl. Math. Optim. 43, 117\u2013128 (2001)","journal-title":"Appl. Math. Optim."},{"key":"709_CR9","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1016\/j.ejor.2009.11.030","volume":"204","author":"N Andrei","year":"2010","unstructured":"Andrei, N.: Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization. Eur. J. Oper. Res. 204, 410\u2013420 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"709_CR10","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1080\/10556788.2016.1233971","volume":"32","author":"M Fatemi","year":"2016","unstructured":"Fatemi, M.: A scaled conjugate gradient method for nonlinear unconstrained optimization. Optim. Methods Softw. 32, 1095\u20131112 (2016)","journal-title":"Optim. Methods Softw."},{"key":"709_CR11","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s002450010019","volume":"43","author":"Y Dai","year":"2001","unstructured":"Dai, Y., Liao, L.: New conjugacy conditions and related nonlinear conjugate gradient methods. Appl. Math. Optim. 43, 87\u2013101 (2001)","journal-title":"Appl. Math. Optim."},{"key":"709_CR12","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/030601880","volume":"16","author":"WW Hager","year":"2005","unstructured":"Hager, W.W., Zhang, H.: A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J. Optim. 16, 170\u2013192 (2005)","journal-title":"SIAM J. Optim."},{"key":"709_CR13","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/s10957-017-1140-1","volume":"175","author":"Y Zheng","year":"2017","unstructured":"Zheng, Y., Zhen, B.: Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems. J. Optim. Theory Appl. 175, 502\u2013509 (2017)","journal-title":"J. Optim. Theory Appl."},{"key":"709_CR14","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.cam.2017.04.045","volume":"325","author":"N Andrei","year":"2017","unstructured":"Andrei, N.: Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update. J. Comput. Appl. Math. 325, 149\u2013164 (2017)","journal-title":"J. Comput. Appl. Math."},{"key":"709_CR15","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/s11075-017-0284-2","volume":"76","author":"Y Yang","year":"2017","unstructured":"Yang, Y., Chen, Y., Lu, Y.: A subspace conjugate gradient algorithm for large-scale unconstrained optimization. Numerical Algorithms 76, 813\u2013828 (2017)","journal-title":"Numerical Algorithms"},{"key":"709_CR16","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1080\/10556788.2016.1266354","volume":"32","author":"A Alhawarat","year":"2017","unstructured":"Alhawarat, A., Salleh, Z., Mamat, M., Rivaie, M.: An efficient modified Polak-Ribi\u00e9re-Polyak conjugate gradient method with global convergence properties. Optim. Methods Softw. 32, 1299\u20131312 (2017)","journal-title":"Optim. Methods Softw."},{"key":"709_CR17","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1016\/j.cam.2017.07.035","volume":"328","author":"Z Liu","year":"2018","unstructured":"Liu, Z., Liu, H.: Several efficient gradient methods with approximate optimal step sizes for large scale unconstrained optimization. J. Comput. Appl. Math. 328, 400\u2013413 (2018)","journal-title":"J. Comput. Appl. Math."},{"key":"709_CR18","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1080\/10556788.2013.833199","volume":"29","author":"S Babaie-Kafaki","year":"2014","unstructured":"Babaie-Kafaki, S., Ghanbari, R.: A descent family of Dai-Liao conjugate gradient methods. Optim. Methods Softw. 29, 583\u2013591 (2014)","journal-title":"Optim. Methods Softw."},{"key":"709_CR19","doi-asserted-by":"publisher","first-page":"1789","DOI":"10.1007\/s11590-015-0965-5","volume":"10","author":"S Babaie-Kafaki","year":"2016","unstructured":"Babaie-Kafaki, S.: On optimality of two adaptive choices for the parameter of Dai-Liao method. Optim. Lett. 10, 1789\u20131797 (2016)","journal-title":"Optim. Lett."},{"key":"709_CR20","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/s10957-015-0786-9","volume":"169","author":"M Fatemi","year":"2016","unstructured":"Fatemi, M.: An optimal parameter for Dai\u2013Liao family of conjugate gradient methods. J. Optim. Theory Appl. 169, 587\u2013605 (2016)","journal-title":"J. Optim. Theory Appl."},{"key":"709_CR21","unstructured":"Beale, E.M.L.: A derivation of conjugate gradients. In: Lootsma, F.A. (ed.) Numerical Methods for Nonlinear Optimization, pp 39\u201343. Academic Press, London (1972)"},{"key":"709_CR22","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF00933447","volume":"23","author":"L Nazareth","year":"1977","unstructured":"Nazareth, L.: A conjugate direction algorithm without line searches. J. Optim. Theory Appl. 23, 373\u2013387 (1977)","journal-title":"J. Optim. Theory Appl."},{"key":"709_CR23","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF00941495","volume":"47","author":"LCW Dixon","year":"1985","unstructured":"Dixon, L.C.W., Ducksbury, P.G., Ningh, P.: A new three-term conjugate gradient method. J. Optim. Theory Appl. 47, 285\u2013300 (1985)","journal-title":"J. Optim. Theory Appl."},{"key":"709_CR24","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1137\/080743573","volume":"21","author":"Y Narushima","year":"2011","unstructured":"Narushima, Y., Yabe, H., Ford, J.A.: A three-term conjugate gradient method with sufficient descent property for unconstrained optimization. SIAM J. Optim. 21, 212\u2013230 (2011)","journal-title":"SIAM J. Optim."},{"key":"709_CR25","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.1080\/02331931003653187","volume":"60","author":"N Andrei","year":"2011","unstructured":"Andrei, N.: A modified Polak-Ribi\u00e9re-Polyak conjugate gradient algorithm for unconstrained optimization. Optimization 60, 1457\u20131471 (2011)","journal-title":"Optimization"},{"key":"709_CR26","doi-asserted-by":"publisher","first-page":"295","DOI":"10.2306\/scienceasia1513-1874.2014.40.295","volume":"40","author":"JK Liu","year":"2014","unstructured":"Liu, J.K., Wu, X.S.: New three-term conjugate gradient method for solving unconstrained optimization problems. Sci. Asia 40, 295\u2013300 (2014)","journal-title":"Sci. Asia"},{"key":"709_CR27","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10589-014-9662-z","volume":"60","author":"M Al-Baali","year":"2015","unstructured":"Al-Baali, M., Narushima, Y., Yabe, H.: A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization. Comput. Optim. Appl. 60, 89\u2013110 (2015)","journal-title":"Comput. Optim. Appl."},{"key":"709_CR28","first-page":"1","volume":"97","author":"Y Wu","year":"2017","unstructured":"Wu, Y.: A modified three-term PRP conjugate gradient algorithm for optimization models. Journal of Inequalities and Applications 97, 1\u201314 (2017)","journal-title":"Journal of Inequalities and Applications"},{"key":"709_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10092-018-0244-9","volume":"55","author":"JK Liu","year":"2018","unstructured":"Liu, J.K., Feng, Y.M., Zou, L.M.: Some three-term conjugate gradient methods with the inexact line search condition. Calcolo 55, 1\u201316 (2018)","journal-title":"Calcolo"},{"key":"709_CR30","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.H.: A descent modified Polak-Ribi\u00e9re-Polyak conjugate gradient method and its global convergence. IMA J. Numer. Anal. 26, 629\u2013640 (2006)","journal-title":"IMA J. Numer. Anal."},{"key":"709_CR31","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.cam.2012.10.002","volume":"241","author":"N Andrei","year":"2013","unstructured":"Andrei, N.: A simple three-term conjugate gradient algorithm for unconstrained optimization. J. Comput. Appl. Math. 241, 19\u201329 (2013)","journal-title":"J. Comput. Appl. Math."},{"key":"709_CR32","first-page":"6316","volume":"219","author":"N Andrei","year":"2013","unstructured":"Andrei, N.: On three-term conjugate gradient algorithms for unconstrained optimization. Appl. Math. Comput. 219, 6316\u20136327 (2013)","journal-title":"Appl. Math. Comput."},{"key":"709_CR33","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.cam.2017.10.013","volume":"332","author":"S Yao","year":"2018","unstructured":"Yao, S., Ning, L.: An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix. J. Comput. Appl. Math. 332, 72\u201385 (2018)","journal-title":"J. Comput. Appl. Math."},{"key":"709_CR34","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1080\/10556780701223293","volume":"22","author":"L Zhang","year":"2007","unstructured":"Zhang, L., Zhou, W.J., Li, D.H.: Some descent three-term conjugate gradient methods and their global convergence. Optim. Methods Softw. 22, 697\u2013711 (2007)","journal-title":"Optim. Methods Softw."},{"key":"709_CR35","doi-asserted-by":"publisher","first-page":"1744","DOI":"10.1080\/00207160.2013.862236","volume":"91","author":"JK Liu","year":"2014","unstructured":"Liu, J.K., Li, S.J.: New three-term conjugate gradient method with guaranteed global convergence. Int. J. Comput. Math. 91, 1744\u20131754 (2014)","journal-title":"Int. J. Comput. Math."},{"key":"709_CR36","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.apnum.2015.01.008","volume":"92","author":"S Deng","year":"2015","unstructured":"Deng, S., Wan, Z.: A three-term conjugate gradient algorithm for large-scale unconstrained optimization problems. Appl. Numer. Math. 92, 70\u201381 (2015)","journal-title":"Appl. Numer. Math."},{"key":"709_CR37","first-page":"606","volume":"269","author":"XL Dong","year":"2015","unstructured":"Dong, X.L., Liu, H.W., He, Y.B.: New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction. Appl. Math. Comput. 269, 606\u2013617 (2015)","journal-title":"Appl. Math. Comput."},{"key":"709_CR38","first-page":"1","volume":"325","author":"I Arzuka","year":"2016","unstructured":"Arzuka, I., Abu Bakar, M.R., Leong, W.J.: A scaled three-term conjugate gradient method for unconstrained optimization. Journal of Inequalities and Applications 325, 1\u201316 (2016)","journal-title":"Journal of Inequalities and Applications"},{"key":"709_CR39","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF01593790","volume":"12","author":"MJD Powell","year":"1977","unstructured":"Powell, M.J.D.: Restart procedures for the conjugate gradient method. Math. Program. 12, 241\u2013254 (1977)","journal-title":"Math. Program."},{"key":"709_CR40","unstructured":"Sun, W., Yuan, Y.X.: Optimization theory and methods: nonlinear programming. Springer Optimization and its Applications, Springer (2006)"},{"key":"709_CR41","first-page":"147","volume":"10","author":"N Andrei","year":"2008","unstructured":"Andrei, N.: An unconstrained optimization test functions collection. Advanced Modeling and Optimization 10, 147\u2013161 (2008)","journal-title":"Advanced Modeling and Optimization"},{"key":"709_CR42","unstructured":"Burke, J.V., Engle, A.: Line search methods for convex-composite optimization. arXiv:\n1806.05218v1\n\n (2018)"},{"key":"709_CR43","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-019-00709-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-019-00709-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-019-00709-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,30]],"date-time":"2020-04-30T23:38:11Z","timestamp":1588289891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-019-00709-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,2]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["709"],"URL":"https:\/\/doi.org\/10.1007\/s11075-019-00709-7","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2019,5,2]]},"assertion":[{"value":"17 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}