{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T20:50:23Z","timestamp":1649191823612},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T00:00:00Z","timestamp":1188604800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Jrl Syst Sci & Complex"],"published-print":{"date-parts":[[2007,9]]},"DOI":"10.1007\/s11424-007-9037-y","type":"journal-article","created":{"date-parts":[[2007,10,18]],"date-time":"2007-10-18T11:22:03Z","timestamp":1192706523000},"page":"416-428","source":"Crossref","is-referenced-by-count":0,"title":["Global Convergence of the Dai-Yuan Conjugate Gradient Method with Perturbations"],"prefix":"10.1007","volume":"20","author":[{"given":"Changyu","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meixia","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"9037_CR1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1093\/imanum\/5.1.121","volume":"5","author":"M. Al-Baali","year":"1985","unstructured":"M. Al-Baali, Descent property and global convergence of the Fletcher-Reeves method with inexact line search, IMA J. Numer. Anal., 1985, 5(1): 121\u2013124.","journal-title":"IMA J. Numer. Anal."},{"key":"9037_CR2","first-page":"241","volume":"2","author":"M.J.D. Powell","year":"1997","unstructured":"M. J. D. Powell, Restart procedures of the conjugate gradient method, Math. Program., 1997, 2: 241\u2013245.","journal-title":"Math. Program."},{"key":"9037_CR3","doi-asserted-by":"crossref","unstructured":"M. J. D. Powell, Non-convex minimization calculations and the conjugate gradient method, Lecture Notes in Math., Springer-Verlag, Berlin, 1984, 1066: 122\u2013141.","DOI":"10.1007\/BFb0099521"},{"issue":"1","key":"9037_CR4","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"Y.H. Dai","year":"1999","unstructured":"Y. H. Dai and Y. Yuan, A nonlinear conjugate gradient method with a strong global convergence property, SIAM J. Optim., 1999, 10(1): 177\u2013182.","journal-title":"SIAM J. Optim."},{"key":"9037_CR5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/978-1-4613-3335-7_11","volume-title":"Advances in Nonlinear Programing","author":"Y. H. Dai","year":"1998","unstructured":"Y. H. Dai and Y. Yuan, Some properties of a new conjugate gradient method, in Advances in Nonlinear Programing (ed. by Y. Yuan), Kluwer, Boston, 1998, 251\u2013262."},{"key":"9037_CR6","first-page":"83","volume":"12","author":"B.T. Poljak","year":"1973","unstructured":"B. T. Poljak and Y. Z. Tsypkin, Pseudogradient adaptation and training algorithms, Automat. Remote Control, 1973, 12: 83\u201394.","journal-title":"Automat. Remote Control"},{"issue":"2","key":"9037_CR7","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1137\/S1052623495294797","volume":"8","author":"P. Tseng","year":"1998","unstructured":"P. Tseng, Incremental gradient (-projection) method with momentum term and adaptive stepsize rule, SIAM J. on Optim., 1998, 8(2): 506\u2013531.","journal-title":"SIAM J. on Optim."},{"issue":"2","key":"9037_CR8","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1080\/10556789408805582","volume":"4","author":"A.A. Gaivoronski","year":"1994","unstructured":"A. A. Gaivoronski, Convergence properties of backpropagation for neural nets via theory of stochastic gradient methods, Part 1, Optim. Methods Software, 1994, 4(2): 117\u2013134.","journal-title":"Optim. Methods Software"},{"issue":"2","key":"9037_CR9","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1080\/10556789408805583","volume":"4","author":"L. Grippo","year":"1994","unstructured":"L. Grippo, A class of unconstrained minimization methods for neural network training, Optim. Methods Software, 1994, 4(2): 135\u2013150.","journal-title":"Optim. Methods Software"},{"issue":"2","key":"9037_CR10","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1080\/10556789408805581","volume":"4","author":"O.L. Mangasarian","year":"1994","unstructured":"O. L. Mangasarian and M. V. Solodov, Serial and parallel backpropagation convergence via nonmonotone perturbed minimization, Optim. Methods Software, 1994, 4(2): 103\u2013116.","journal-title":"Optim. Methods Software"},{"key":"9037_CR11","unstructured":"O. L. Mangasarian and M. V. Solodov, Backpropagation convergence via deternministic nonmonotone perturbed minimization, in Advances in Neural Information Processing Systems 6 (ed. by G. Tesauro, J. D. Cowan, and J. Alspector), Morgan Kaufmann, San Francisco, 1994, 383\u2013390."},{"issue":"3","key":"9037_CR12","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1137\/S1052623497331063","volume":"10","author":"D.P. Bertsekas","year":"2000","unstructured":"D. P. Bertsekas and J. N. Tsitsiklis, Gradient convergence in gradient methods with errors, SIAM J. Optim., 2000, 10(3): 627\u2013642.","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9037_CR13","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1023\/A:1022602123316","volume":"93","author":"M.V. Solodov","year":"1997","unstructured":"M. V. Solodov, Convergence analysis of perturbed feasible descent methods, J. Optim. Theory Appl., 1997, 93(2): 337\u2013353.","journal-title":"J. Optim. Theory Appl."},{"key":"9037_CR14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1023\/A:1018366000512","volume":"11","author":"M.V. Solodov","year":"1998","unstructured":"M. V. Solodov, Incremental gradient algorithms with stepsizes bounded away from zero, Computational Optimization and Applications, 1998, 11: 23\u201335.","journal-title":"Computational Optimization and Applications"},{"issue":"2","key":"9037_CR15","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0377-0427(97)00025-3","volume":"80","author":"M.V. Solodov","year":"1997","unstructured":"M. V. Solodov and B. F. Svaiter, Descent methods with linesearch in the presence of perturbations, Journal of Computational and Applied Mathematics, 1997, 80(2): 265\u2013275.","journal-title":"Journal of Computational and Applied Mathematics"},{"issue":"9","key":"9037_CR16","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1007\/BF02880382","volume":"42","author":"Y.H. Dai","year":"1999","unstructured":"Y. H. Dai, Further insight into the convergence of the Fletcher-Reeves method, Science in China, 1999, 42(9): 905\u2013916.","journal-title":"Science in China"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-007-9037-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-007-9037-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-007-9037-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:53:56Z","timestamp":1559400836000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-007-9037-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["9037"],"URL":"https:\/\/doi.org\/10.1007\/s11424-007-9037-y","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9]]}}}