{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:13:25Z","timestamp":1772295205020,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,7,18]],"date-time":"2017-07-18T00:00:00Z","timestamp":1500336000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 11571004"],"award-info":[{"award-number":["No. 11571004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s10957-017-1140-1","type":"journal-article","created":{"date-parts":[[2017,7,18]],"date-time":"2017-07-18T19:22:45Z","timestamp":1500405765000},"page":"502-509","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Two New Dai\u2013Liao-Type Conjugate Gradient Methods for Unconstrained Optimization Problems"],"prefix":"10.1007","volume":"175","author":[{"given":"Yutao","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bing","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,18]]},"reference":[{"key":"1140_CR1","volume-title":"Optimization Theory and Methods: Nonlinear Programming","author":"W Sun","year":"2006","unstructured":"Sun, W., Yuan, Y.: Optimization Theory and Methods: Nonlinear Programming. Springer, New York (2006)"},{"key":"1140_CR2","doi-asserted-by":"publisher","unstructured":"Dai, Y.: Nonlinear conjugate gradient methods. Oper. Res. Manag. Sci, Wiley Encycl (2011). doi: 10.1002\/9780470400531.eorms0183","DOI":"10.1002\/9780470400531.eorms0183"},{"issue":"6","key":"1140_CR3","doi-asserted-by":"crossref","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(6), 409\u2013436 (1952)","journal-title":"J. Res. Natl. Bur. Stand."},{"issue":"R1","key":"1140_CR4","first-page":"35","volume":"3","author":"E Polak","year":"1969","unstructured":"Polak, E., Ribiere, G.: Note sur la convergence de m\u00e9thodes de directions conjugu\u00e9es. ESAIM: Math. Model. Numer. Anal. - Mod\u00e9lisation Math\u00e9matique et Analyse Num\u00e9rique 3(R1), 35\u201343 (1969)","journal-title":"ESAIM: Math. Model. Numer. Anal. - Mod\u00e9lisation Math\u00e9matique et Analyse Num\u00e9rique"},{"issue":"4","key":"1140_CR5","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","volume":"9","author":"B Polyak","year":"1969","unstructured":"Polyak, B.: The conjugate gradient method in extremal problems. USSR Comput. Math. Math. Phys. 9(4), 94\u2013112 (1969)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"1","key":"1140_CR6","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF00940464","volume":"69","author":"Y Liu","year":"1991","unstructured":"Liu, Y., Storey, C.: Efficient generalized conjugate gradient algorithms, part 1: theory. J. Optim. Theory Appl. 69(1), 129\u2013137 (1991)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1140_CR7","doi-asserted-by":"crossref","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(1), 87\u2013101 (2001)","journal-title":"Appl. Math. Optim."},{"issue":"1","key":"1140_CR8","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":"2","key":"1140_CR9","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1023\/B:COAP.0000026885.81997.88","volume":"28","author":"H Yabe","year":"2004","unstructured":"Yabe, H., Takano, M.: Global convergence properties of nonlinear conjugate gradient methods with modified secant condition. Comput. Optim. Appl. 28(2), 203\u2013225 (2004)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1140_CR10","doi-asserted-by":"crossref","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.: New conjugacy condition and related new conjugate gradient methods for unconstrained optimization. J. Comput. Appl. Math. 202(2), 523\u2013539 (2007)","journal-title":"J. Comput. Appl. Math."},{"key":"1140_CR11","doi-asserted-by":"publisher","unstructured":"Yao, S., Qin, B.: A hybrid of DL and WYL nonlinear conjugate gradient methods. Abstr. Appl. Anal. 2014, 279891 (2014). doi: 10.1155\/2014\/279891","DOI":"10.1155\/2014\/279891"},{"key":"1140_CR12","doi-asserted-by":"publisher","unstructured":"Yao, S., Lu, X., Wei, Z.: A conjugate gradient method with global convergence for large-scale unconstrained optimization problems. J. Appl. Math. 2013, 730454 (2013). doi: 10.1155\/2013\/730454","DOI":"10.1155\/2013\/730454"},{"issue":"3","key":"1140_CR13","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1080\/10556788.2015.1124431","volume":"31","author":"Y Cheng","year":"2016","unstructured":"Cheng, Y., Mou, Q., Pan, X., Yao, S.: A sufficient descent conjugate gradient method and its global convergence. Optim. Methods Softw. 31(3), 577\u2013590 (2016)","journal-title":"Optim. Methods Softw."},{"issue":"14","key":"1140_CR14","doi-asserted-by":"crossref","first-page":"7421","DOI":"10.1016\/j.amc.2011.12.091","volume":"218","author":"Z Dai","year":"2012","unstructured":"Dai, Z., Wen, F.: Another improved Wei\u2013Yao\u2013Liu nonlinear conjugate gradient method with sufficient descent property. Appl. Math. Comput. 218(14), 7421\u20137430 (2012)","journal-title":"Appl. Math. Comput."},{"key":"1140_CR15","first-page":"37","volume-title":"Integer and Nonlinear Programming","author":"G Zoutendijk","year":"1970","unstructured":"Zoutendijk, G.: Nonlinear programming computational methods. In: Abadie, J. (ed.) Integer and Nonlinear Programming, pp. 37\u201386. North-Holland, Amsterdam (1970)"},{"issue":"1","key":"1140_CR16","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1137\/0802003","volume":"2","author":"J Gilbert","year":"1992","unstructured":"Gilbert, J., Nocedal, J.: Global convergence properties of conjugate gradient methods for optimization. SIAM J. Optim. 2(1), 21\u201342 (1992)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1140_CR17","first-page":"147","volume":"10","author":"N Andrei","year":"2008","unstructured":"Andrei, N.: An unconstrained optimization test functions collection. Adv. Model. Optim. 10(1), 147\u2013161 (2008)","journal-title":"Adv. Model. Optim."},{"issue":"3","key":"1140_CR18","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NIM Gould","year":"2015","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput. Optim. Appl. 60(3), 545\u2013557 (2015)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1140_CR19","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), 201\u2013213 (2002)","journal-title":"Math. Program."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-017-1140-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-017-1140-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-017-1140-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,31]],"date-time":"2022-07-31T03:54:20Z","timestamp":1659239660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-017-1140-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,18]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["1140"],"URL":"https:\/\/doi.org\/10.1007\/s10957-017-1140-1","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,18]]}}}