{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,20]],"date-time":"2023-08-20T05:44:24Z","timestamp":1692510264430},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2015,10,31]],"date-time":"2015-10-31T00:00:00Z","timestamp":1446249600000},"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":["Optim Lett"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s11590-015-0965-5","type":"journal-article","created":{"date-parts":[[2015,10,31]],"date-time":"2015-10-31T19:25:45Z","timestamp":1446319545000},"page":"1789-1797","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On optimality of two adaptive choices for the parameter of Dai\u2013Liao method"],"prefix":"10.1007","volume":"10","author":[{"given":"Saman","family":"Babaie-Kafaki","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,31]]},"reference":[{"issue":"4","key":"965_CR1","first-page":"333","volume":"16","author":"N Andrei","year":"2007","unstructured":"Andrei, N.: Numerical comparison of conjugate gradient algorithms for unconstrained optimization. Stud. Inform. Control 16(4), 333\u2013352 (2007)","journal-title":"Stud. Inform. Control"},{"issue":"2","key":"965_CR2","first-page":"319","volume":"34","author":"N Andrei","year":"2011","unstructured":"Andrei, N.: Open problems in conjugate gradient algorithms for unconstrained optimization. B. Malays. Math. Sci. So. 34(2), 319\u2013330 (2011)","journal-title":"B. Malays. Math. Sci. So."},{"issue":"4","key":"965_CR3","doi-asserted-by":"crossref","first-page":"1350092","DOI":"10.1142\/S0219876213500928","volume":"11","author":"S Babaie-Kafaki","year":"2014","unstructured":"Babaie-Kafaki, S.: An adaptive conjugacy condition and related nonlinear conjugate gradient methods. Int. J. Comput. Methods 11(4), 1350092 (2014)","journal-title":"Int. J. Comput. Methods"},{"issue":"3","key":"965_CR4","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s10288-014-0255-6","volume":"12","author":"S Babaie-Kafaki","year":"2014","unstructured":"Babaie-Kafaki, S.: On the sufficient descent condition of the Hager-Zhang conjugate gradient methods. 4OR 12(3), 285\u2013292 (2014)","journal-title":"4OR"},{"issue":"3","key":"965_CR5","doi-asserted-by":"crossref","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.: The Dai\u2013Liao nonlinear conjugate gradient method with optimal parameter choices. Eur. J. Oper. Res. 234(3), 625\u2013630 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"965_CR6","doi-asserted-by":"crossref","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\u2013Liao conjugate gradient methods. Optim. Methods Softw. 29(3), 583\u2013591 (2014)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"965_CR7","doi-asserted-by":"crossref","first-page":"2277","DOI":"10.1080\/02331934.2014.938072","volume":"64","author":"S Babaie-Kafaki","year":"2015","unstructured":"Babaie-Kafaki, S., Ghanbari, R.: Two optimal Dai\u2013Liao conjugate gradient methods. Optimization 64(1), 2277\u20132287 (2015)","journal-title":"Optimization"},{"issue":"2","key":"965_CR8","first-page":"348","volume":"10","author":"YH Dai","year":"1999","unstructured":"Dai, Y.H., Han, J.Y., Liu, G.H., Sun, D.F., Yin, H.X., Yuan, Y.X.: Convergence properties of nonlinear conjugate gradient methods. SIAM J. Optim. 10(2), 348\u2013358 (1999)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"965_CR9","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1137\/100813026","volume":"23","author":"YH Dai","year":"2013","unstructured":"Dai, Y.H., Kou, C.X.: A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search. SIAM J. Optim. 23(1), 296\u2013320 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"965_CR10","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s002450010019","volume":"43","author":"YH Dai","year":"2001","unstructured":"Dai, Y.H., Liao, L.Z.: New conjugacy conditions and related nonlinear conjugate gradient methods. Appl. Math. Optim. 43(1), 87\u2013101 (2001)","journal-title":"Appl. Math. Optim."},{"issue":"2, Ser. A","key":"965_CR11","doi-asserted-by":"crossref","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(2, Ser. A), 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"4","key":"965_CR12","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"NIM Gould","year":"2003","unstructured":"Gould, N.I.M., Orban, D., Toint, PhL: CUTEr: a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29(4), 373\u2013394 (2003)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"965_CR13","doi-asserted-by":"crossref","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(1), 170\u2013192 (2005)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"965_CR14","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/1132973.1132979","volume":"32","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: Algorithm 851: CG $$_{-}$$ - Descent, a conjugate gradient method with guaranteed descent. ACM Trans. Math. Softw. 32(1), 113\u2013137 (2006)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"965_CR15","first-page":"35","volume":"2","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: A survey of nonlinear conjugate gradient methods. Pac. J. Optim. 2(1), 35\u201358 (2006)","journal-title":"Pac. J. Optim."},{"issue":"6","key":"965_CR16","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1287\/opre.26.6.1073","volume":"26","author":"A Perry","year":"1976","unstructured":"Perry, A.: A modified conjugate gradient algorithm. Oper. Res. 26(6), 1073\u20131078 (1976)","journal-title":"Oper. Res."},{"issue":"1","key":"965_CR17","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0377-0427(02)00396-5","volume":"143","author":"G Piazza","year":"2002","unstructured":"Piazza, G., Politi, T.: An upper bound for the condition number of a matrix in spectral norm. J. Comput. Appl. Math. 143(1), 141\u2013144 (2002)","journal-title":"J. Comput. Appl. Math."},{"key":"965_CR18","doi-asserted-by":"crossref","unstructured":"Stewart, G.W.: Matrix Algorithms, Volume 1: basic decompositions. SIAM, Philadelphia (1998)","DOI":"10.1137\/1.9781611971408"},{"key":"965_CR19","volume-title":"Optimization Theory and Methods: Nonlinear Programming","author":"W Sun","year":"2006","unstructured":"Sun, W., Yuan, Y.X.: Optimization Theory and Methods: Nonlinear Programming. Springer, New York (2006)"},{"key":"965_CR20","doi-asserted-by":"crossref","DOI":"10.1002\/0471249718","volume-title":"Fundamentals of Matrix Computations","author":"DS Watkins","year":"2002","unstructured":"Watkins, D.S.: Fundamentals of Matrix Computations. Wiley, New York (2002)"},{"issue":"4","key":"965_CR21","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1080\/10556780701223293","volume":"22","author":"L Zhang","year":"2007","unstructured":"Zhang, L., Zhou, W., Li, D.H.: Some descent three-term conjugate gradient methods and their global convergence. Optim. Methods Softw. 22(4), 697\u2013711 (2007)","journal-title":"Optim. Methods Softw."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0965-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0965-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0965-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0965-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T05:06:47Z","timestamp":1567314407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0965-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,31]]},"references-count":21,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["965"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0965-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,31]]}}}