{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T12:46:39Z","timestamp":1744893999746},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,9,26]],"date-time":"2018-09-26T00:00:00Z","timestamp":1537920000000},"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":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s10288-018-0387-1","type":"journal-article","created":{"date-parts":[[2018,9,26]],"date-time":"2018-09-26T19:46:02Z","timestamp":1537991162000},"page":"317-330","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["An optimal parameter choice for the Dai\u2013Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix"],"prefix":"10.1007","volume":"17","author":[{"given":"Zohre","family":"Aminifard","sequence":"first","affiliation":[]},{"given":"Saman","family":"Babaie-Kafaki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,26]]},"reference":[{"issue":"4","key":"387_CR1","first-page":"333","volume":"16","author":"N Andrei","year":"2007","unstructured":"Andrei N (2007) Numerical comparison of conjugate gradient algorithms for unconstrained optimization. Stud Inform Control 16(4):333\u2013352","journal-title":"Stud Inform Control"},{"issue":"2","key":"387_CR2","first-page":"319","volume":"34","author":"N Andrei","year":"2011","unstructured":"Andrei N (2011) Open problems in conjugate gradient algorithms for unconstrained optimization. Bull Malays Math Sci Soc 34(2):319\u2013330","journal-title":"Bull Malays Math Sci Soc"},{"issue":"1","key":"387_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.cam.2015.07.003","volume":"292","author":"N Andrei","year":"2016","unstructured":"Andrei N (2016) An adaptive conjugate gradient algorithm for large-scale unconstrained optimization. J Comput Appl Math 292(1):83\u201391","journal-title":"J Comput Appl Math"},{"key":"387_CR4","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1007\/s11075-017-0362-5","volume":"77","author":"N Andrei","year":"2017","unstructured":"Andrei N (2017) A Dai\u2013Liao conjugate gradient algorithm with clustering of eigenvalues. Numer Algorithms 77:1273\u20131282. https:\/\/doi.org\/10.1007\/s11075-017-0362-5","journal-title":"Numer Algorithms"},{"issue":"3","key":"387_CR5","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10288-014-0255-6","volume":"12","author":"S Babaie-Kafaki","year":"2014","unstructured":"Babaie-Kafaki S (2014) On the sufficient descent condition of the Hager\u2013Zhang conjugate gradient methods. 4OR 12(3):285\u2013292","journal-title":"4OR"},{"issue":"3","key":"387_CR6","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1016\/j.ejor.2013.11.012","volume":"234","author":"S Babaie-Kafaki","year":"2014","unstructured":"Babaie-Kafaki S, Ghanbari R (2014) The Dai\u2013Liao nonlinear conjugate gradient method with optimal parameter choices. Eur J Oper Res 234(3):625\u2013630","journal-title":"Eur J Oper Res"},{"issue":"3","key":"387_CR7","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 (2014) A descent family of Dai\u2013Liao conjugate gradient methods. Optim Methods Softw 29(3):583\u2013591","journal-title":"Optim Methods Softw"},{"issue":"8","key":"387_CR8","doi-asserted-by":"publisher","first-page":"2285","DOI":"10.1007\/s11590-014-0736-8","volume":"8","author":"S Babaie-Kafaki","year":"2014","unstructured":"Babaie-Kafaki S, Ghanbari R (2014) Two modified three-term conjugate gradient methods with sufficient descent property. Optim Lett 8(8):2285\u20132297","journal-title":"Optim Lett"},{"issue":"11","key":"387_CR9","doi-asserted-by":"publisher","first-page":"2277","DOI":"10.1080\/02331934.2014.938072","volume":"64","author":"S Babaie-Kafaki","year":"2015","unstructured":"Babaie-Kafaki S, Ghanbari R (2015) Two optimal Dai\u2013Liao conjugate gradient methods. Optimization 64(11):2277\u20132287","journal-title":"Optimization"},{"issue":"1","key":"387_CR10","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 (2017a) A class of adaptive Dai\u2013Liao conjugate gradient methods based on the scaled memoryless BFGS update. 4OR 15(1):85\u201392","journal-title":"4OR"},{"issue":"2","key":"387_CR11","doi-asserted-by":"crossref","first-page":"649","DOI":"10.3934\/jimo.2016038","volume":"3","author":"S Babaie-Kafaki","year":"2017","unstructured":"Babaie-Kafaki S, Ghanbari R (2017b) A class of descent four-term extension of the Dai\u2013Liao conjugate gradient method based on the scaled memoryless BFGS update. J Ind Manag Optim 3(2):649\u2013658","journal-title":"J Ind Manag Optim"},{"issue":"7","key":"387_CR12","first-page":"2437","volume":"43","author":"S Babaie-Kafaki","year":"2017","unstructured":"Babaie-Kafaki S, Ghanbari R (2017c) Extensions of the Hestenes-Stiefel and Polak-Ribi\u00e8re-Polyak conjugate gradient methods with sufficient descent property. Bull Iran Math Soc 43(7):2437\u20132448","journal-title":"Bull Iran Math Soc"},{"key":"387_CR13","doi-asserted-by":"publisher","first-page":"1505","DOI":"10.1007\/s40995-017-0271-4","volume":"42","author":"S Babaie-Kafaki","year":"2017","unstructured":"Babaie-Kafaki S, Ghanbari R (2017d) Two adaptive Dai\u2013Liao nonlinear conjugate gradient methods. Iran J Sci Technol Trans Sci 42:1505\u20131509. https:\/\/doi.org\/10.1007\/s40995-017-0271-4","journal-title":"Iran J Sci Technol Trans Sci"},{"issue":"5","key":"387_CR14","doi-asserted-by":"publisher","first-page":"1374","DOI":"10.1016\/j.cam.2010.01.052","volume":"234","author":"S Babaie-Kafaki","year":"2010","unstructured":"Babaie-Kafaki S, Ghanbari R, Mahdavi-Amiri N (2010) Two new conjugate gradient methods based on modified secant equations. J Comput Appl Math 234(5):1374\u20131386","journal-title":"J Comput Appl Math"},{"issue":"2","key":"387_CR15","first-page":"348","volume":"10","author":"YH Dai","year":"1999","unstructured":"Dai YH, Han JY, Liu GH, Sun DF, Yin HX, Yuan YX (1999) Convergence properties of nonlinear conjugate gradient methods. SIAM J Optim 10(2):348\u2013358","journal-title":"SIAM J Optim"},{"issue":"1","key":"387_CR16","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":"1","key":"387_CR17","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s002450010019","volume":"43","author":"YH Dai","year":"2001","unstructured":"Dai YH, Liao LZ (2001) New conjugacy conditions and related nonlinear conjugate gradient methods. Appl Math Optim 43(1):87\u2013101","journal-title":"Appl Math Optim"},{"issue":"2","key":"387_CR18","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":"1","key":"387_CR19","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.cam.2015.12.035","volume":"300","author":"M Fatemi","year":"2016","unstructured":"Fatemi M (2016) A new efficient conjugate gradient method for unconstrained optimization. J Comput Appl Math 300(1):207\u2013216","journal-title":"J Comput Appl Math"},{"issue":"2","key":"387_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 (2016) An optimal parameter for Dai\u2013Liao family of conjugate gradient methods. J Optim Theory Appl 169(2):587\u2013605","journal-title":"J Optim Theory Appl"},{"issue":"1","key":"387_CR21","first-page":"7","volume":"4","author":"M Fatemi","year":"2016","unstructured":"Fatemi M, Babaie-Kafaki S (2016) Two extensions of the Dai\u2013Liao method with sufficient desent property based on a penalization scheme. Bull Comput Appl Math 4(1):7\u201319","journal-title":"Bull Comput Appl Math"},{"issue":"2","key":"387_CR22","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10589-007-9087-z","volume":"40","author":"JA Ford","year":"2008","unstructured":"Ford JA, Narushima Y, Yabe H (2008) Multi-step nonlinear conjugate gradient methods for unconstrained minimization. Comput Optim Appl 40(2):191\u2013216","journal-title":"Comput Optim Appl"},{"issue":"1","key":"387_CR23","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":"387_CR24","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":"387_CR25","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":"1","key":"387_CR26","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/1132973.1132979","volume":"32","author":"WW Hager","year":"2006","unstructured":"Hager WW, Zhang H (2006) Algorithm 851: CG $$_{-}$$ - Descent, a conjugate gradient method with guaranteed descent. ACM Trans Math Softw 32(1):113\u2013137","journal-title":"ACM Trans Math Softw"},{"issue":"1","key":"387_CR27","first-page":"35","volume":"2","author":"WW Hager","year":"2006","unstructured":"Hager WW, Zhang H (2006) A survey of nonlinear conjugate gradient methods. Pac J Optim 2(1):35\u201358","journal-title":"Pac J Optim"},{"issue":"6","key":"387_CR28","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) Methods of conjugate gradients for solving linear systems. J Res Natl Bur Stand 49(6):409\u2013436","journal-title":"J Res Natl Bur Stand"},{"issue":"2","key":"387_CR29","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/j.cam.2006.03.005","volume":"202","author":"G Li","year":"2007","unstructured":"Li G, Tang C, Wei Z (2007) New conjugacy condition and related new conjugate gradient methods for unconstrained optimization. J Comput Appl Math 202(2):523\u2013539","journal-title":"J Comput Appl Math"},{"key":"387_CR30","doi-asserted-by":"publisher","first-page":"8","DOI":"10.5402\/2012\/435495","volume":"2012","author":"IE Livieris","year":"2012","unstructured":"Livieris IE, Pintelas P (2012) A descent Dai\u2013Liao conjugate gradient method based on a modified secant equation and its global convergence. ISRN Comput Math 2012:8 Article ID 435495","journal-title":"ISRN Comput Math"},{"issue":"17","key":"387_CR31","doi-asserted-by":"publisher","first-page":"4303","DOI":"10.1016\/j.cam.2012.01.036","volume":"236","author":"Y Narushima","year":"2012","unstructured":"Narushima Y, Yabe H (2012) Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization. J Comput Appl Math 236(17):4303\u20134317","journal-title":"J Comput Appl Math"},{"key":"387_CR32","volume-title":"Numerical optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal J, Wright SJ (2006) Numerical optimization. Springer, New York"},{"issue":"6","key":"387_CR33","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1287\/opre.26.6.1073","volume":"26","author":"A Perry","year":"1976","unstructured":"Perry A (1976) A modified conjugate gradient algorithm. Oper Res 26(6):1073\u20131078","journal-title":"Oper Res"},{"issue":"4","key":"387_CR34","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1080\/10556788.2014.1001511","volume":"30","author":"MR Peyghami","year":"2015","unstructured":"Peyghami MR, Ahmadzadeh H, Fazli A (2015) A new class of efficient and globally convergent conjugate gradient methods in the Dai\u2013Liao family. Optim Methods Softw 30(4):843\u2013863","journal-title":"Optim Methods Softw"},{"issue":"4","key":"387_CR35","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1137\/1028154","volume":"28","author":"MJD Powell","year":"1986","unstructured":"Powell MJD (1986) Convergence properties of algorithms for nonlinear optimization. SIAM Rev 28(4):487\u2013500","journal-title":"SIAM Rev"},{"key":"387_CR36","volume-title":"Optimization theory and methods: nonlinear programming","author":"W Sun","year":"2006","unstructured":"Sun W, Yuan YX (2006) Optimization theory and methods: nonlinear programming. Springer, New York"},{"key":"387_CR37","doi-asserted-by":"publisher","DOI":"10.1002\/0471249718","volume-title":"Fundamentals of matrix computations","author":"DS Watkins","year":"2002","unstructured":"Watkins DS (2002) Fundamentals of matrix computations. Wiley, New York"},{"issue":"5","key":"387_CR38","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"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-018-0387-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-018-0387-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-018-0387-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,2]],"date-time":"2022-09-02T20:32:51Z","timestamp":1662150771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-018-0387-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,26]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["387"],"URL":"https:\/\/doi.org\/10.1007\/s10288-018-0387-1","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,26]]},"assertion":[{"value":"28 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}