{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T02:56:06Z","timestamp":1649213766790},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,11,12]],"date-time":"2011-11-12T00:00:00Z","timestamp":1321056000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1007\/s11075-011-9515-0","type":"journal-article","created":{"date-parts":[[2011,11,11]],"date-time":"2011-11-11T06:53:42Z","timestamp":1320994422000},"page":"135-152","source":"Crossref","is-referenced-by-count":1,"title":["A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties"],"prefix":"10.1007","volume":"60","author":[{"given":"Yang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kairong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,11,12]]},"reference":[{"key":"9515_CR1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/200979.201043","volume":"21","author":"IC Bongartz","year":"1995","unstructured":"Bongartz, I.C., Conn, A., Gould, N., Toint, P.: CUTE: Constrained and Unconstrained Testing Environments. ACM Trans. Math. Softw. 21, 123\u2013160 (1995)","journal-title":"ACM Trans. Math. Softw."},{"key":"9515_CR2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/PL00005464","volume":"89","author":"YH Dai","year":"2001","unstructured":"Dai, Y.H.: New properties of a nonlinear conjugate gradient method. Numer. Math. 89, 83\u201398 (2001)","journal-title":"Numer. Math."},{"key":"9515_CR3","doi-asserted-by":"crossref","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":"9515_CR4","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1360\/03ys9027","volume":"46","author":"YH Dai","year":"2003","unstructured":"Dai, Y.H., Yuan, Y.: A class of globally convergent conjugate gradient methods. Sci. China Ser. A 46, 251\u2013261 (2003)","journal-title":"Sci. China Ser. A"},{"key":"9515_CR5","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, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"9515_CR6","volume-title":"Practical Methods of Optimization, vol. 1: Unconstrained Optimization","author":"R Fletcher","year":"1987","unstructured":"Fletcher, R.: Practical Methods of Optimization, vol. 1: Unconstrained Optimization. John Wiley, New York (1987)"},{"key":"9515_CR7","doi-asserted-by":"crossref","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":"9515_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, 170\u2013192 (2005)","journal-title":"SIAM J. Optim."},{"key":"9515_CR9","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\u2212DESCENT, a conjugate gradient method with guaranteed descent. ACM Trans. Math. Softw. 32, 113\u2013137 (2006)","journal-title":"ACM Trans. Math. Softw."},{"key":"9515_CR10","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, 409\u2013436 (1952)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"9515_CR11","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"DC Liu","year":"1989","unstructured":"Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Math. Program. 45, 503\u2013528 (1989)","journal-title":"Math. Program."},{"key":"9515_CR12","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF00940464","volume":"69","author":"YL Liu","year":"1991","unstructured":"Liu, Y.L., Storey, C.S.: Efficient generalized conjugate gradient algorithms, part 1: theory. J. Optim. Theory Appl. 69, 129\u2013137 (1991)","journal-title":"J. Optim. Theory Appl."},{"key":"9515_CR13","first-page":"35","volume":"3","author":"E Polak","year":"1969","unstructured":"Polak, E., Ribi\u00e8re, G.: Note sur la convergence de m\u00e9thodes de directions conjugu\u00e9es. Rev. Fran\u00e7aise Informat. Recherche Op\u00e9rationnelle 3, 35\u201343 (1969)","journal-title":"Rev. Fran\u00e7aise Informat. Recherche Op\u00e9rationnelle"},{"key":"9515_CR14","first-page":"122","volume-title":"Lecture Notes in Mathematics, vol. 1066","author":"MJD Powell","year":"1984","unstructured":"Powell, M.J.D.: Nonconvex minimization calculations and the conjugate gradient method. In: Lecture Notes in Mathematics, vol. 1066, pp. 122\u2013141. Springer, Berlin (1984)"},{"key":"9515_CR15","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1137\/1028154","volume":"28","author":"MJD Powell","year":"1986","unstructured":"Powell, M.J.D.: Convergence properties of algorithms for nonlinear optimization. Math. Program., SIAM Rev. 28, 487\u2013500 (1986)","journal-title":"Math. Program., SIAM Rev."},{"key":"9515_CR16","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF02216822","volume":"24","author":"DJ Pu","year":"1990","unstructured":"Pu, D.J., Yu, W.: On the convergence property of the DFP algorithm. Ann. Oper. Res. 24, 175\u2013184 (1990)","journal-title":"Ann. Oper. Res."},{"key":"9515_CR17","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1137\/1011036","volume":"11","author":"P Wolfe","year":"1969","unstructured":"Wolfe, P.: Convergence conditions for ascent methods. SIAM Rev. 11, 226\u2013235 (1969)","journal-title":"SIAM Rev."},{"key":"9515_CR18","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1137\/1013035","volume":"13","author":"P Wolfe","year":"1971","unstructured":"Wolfe, P.: Convergence conditions for ascent methods II: some corrections. SIAM Rev. 13, 185\u2013188 (1971)","journal-title":"SIAM Rev."},{"key":"9515_CR19","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)"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-011-9515-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-011-9515-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-011-9515-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T05:08:17Z","timestamp":1559365697000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-011-9515-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,12]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["9515"],"URL":"https:\/\/doi.org\/10.1007\/s11075-011-9515-0","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,12]]}}}