{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T06:28:40Z","timestamp":1666074520977},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,5,21]],"date-time":"2011-05-21T00:00:00Z","timestamp":1305936000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10589-011-9413-3","type":"journal-article","created":{"date-parts":[[2011,5,20]],"date-time":"2011-05-20T12:08:14Z","timestamp":1305893294000},"page":"409-414","source":"Crossref","is-referenced-by-count":10,"title":["A note on the global convergence theorem of the scaled conjugate gradient algorithms proposed by Andrei"],"prefix":"10.1007","volume":"52","author":[{"given":"Saman","family":"Babaie-Kafaki","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,5,21]]},"reference":[{"issue":"3","key":"9413_CR1","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s10589-007-9055-7","volume":"38","author":"N. Andrei","year":"2007","unstructured":"Andrei, N.: Scaled conjugate gradient algorithms for unconstrained optimization. Comput. Optim. Appl. 38(3), 401\u2013416 (2007)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"9413_CR2","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1080\/10556780600822260","volume":"22","author":"N. Andrei","year":"2007","unstructured":"Andrei, N.: Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization. Optim. Methods Softw. 22(4), 561\u2013571 (2007)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"9413_CR3","doi-asserted-by":"crossref","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(3), 410\u2013420 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9413_CR4","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J. Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two-point stepsize gradient methods. IMA J. Numer. Anal. 8(1), 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"9413_CR5","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s00245-001-0003-0","volume":"43","author":"E. Birgin","year":"2001","unstructured":"Birgin, E., Mart\u00ednez, J.M.: A spectral conjugate gradient method for unconstrained optimization. Appl. Math. Optim. 43, 117\u2013128 (2001)","journal-title":"Appl. Math. Optim."},{"issue":"2","key":"9413_CR6","first-page":"348","volume":"10","author":"Y.H. 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":"3","key":"9413_CR7","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1287\/moor.3.3.244","volume":"3","author":"D.F. Shanno","year":"1978","unstructured":"Shanno, D.F.: Conjugate gradient methods with inexact searches. Math. Oper. Res. 3(3), 244\u2013256 (1978)","journal-title":"Math. Oper. Res."},{"key":"9413_CR8","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":"9413_CR9","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":"9413_CR10","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."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9413-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-011-9413-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9413-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:40Z","timestamp":1559288200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-011-9413-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,21]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["9413"],"URL":"https:\/\/doi.org\/10.1007\/s10589-011-9413-3","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,21]]}}}