{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T06:53:38Z","timestamp":1648796018636},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,1,19]],"date-time":"2012-01-19T00:00:00Z","timestamp":1326931200000},"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,9]]},"DOI":"10.1007\/s10589-012-9455-1","type":"journal-article","created":{"date-parts":[[2012,1,18]],"date-time":"2012-01-18T11:17:24Z","timestamp":1326885444000},"page":"249-270","source":"Crossref","is-referenced-by-count":4,"title":["A hybrid ODE-based method for unconstrained optimization problems"],"prefix":"10.1007","volume":"53","author":[{"given":"Yi-gui","family":"Ou","sequence":"first","affiliation":[]},{"given":"Guan-shu","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,1,19]]},"reference":[{"key":"9455_CR1","volume-title":"Optimization Theory and Methods","author":"Y.X. Yuan","year":"1997","unstructured":"Yuan, Y.X., Sun, W.Y.: Optimization Theory and Methods. Science Press, Beijing (1997) (in Chinese)"},{"key":"9455_CR2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF00941054","volume":"62","author":"A.A. Brown","year":"1989","unstructured":"Brown, A.A., Biggs, M.C.: Some effective methods for unconstrained optimization based on the solution of system of ordinary differentiable equations. J. Optim. Theory Appl. 62, 211\u2013224 (1989)","journal-title":"J. Optim. Theory Appl."},{"key":"9455_CR3","first-page":"449","volume":"15","author":"L.X. Han","year":"1993","unstructured":"Han, L.X.: On the convergence properties of an ODE algorithm for unconstrained optimization. Math. Numer. Sin. 15, 449\u2013455 (1993)","journal-title":"Math. Numer. Sin."},{"key":"9455_CR4","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1137\/S0036142998335972","volume":"37","author":"D.J. Higham","year":"1999","unstructured":"Higham, D.J.: Trust region algorithms and timestep selection. SIAM J. Numer. Anal. 37, 194\u2013210 (1999)","journal-title":"SIAM J. Numer. Anal."},{"key":"9455_CR5","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/BF00939812","volume":"62","author":"A.A. Brown","year":"1989","unstructured":"Brown, A.A., Biggs, M.C.: ODE versus SQP methods. J. Optim. Theory Appl. 62, 371\u2013386 (1989)","journal-title":"J. Optim. Theory Appl."},{"key":"9455_CR6","unstructured":"Andrei, N.: Gradient flow algorithm for unconstrained optimization. ICI Technical Report (March 4, 2004). http:\/\/csmo.ici.ro\/neculai\/anman.htm"},{"key":"9455_CR7","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s10957-008-9469-0","volume":"140","author":"X.L. Luo","year":"2009","unstructured":"Luo, X.L., Kelley, C.T., Liao, L.Z., Tam, H.W.: Combining trust-region techniques and Rosenbrock methods to compute stationary points. J. Optim. Theory Appl. 140, 265\u2013286 (2009)","journal-title":"J. Optim. Theory Appl."},{"key":"9455_CR8","volume-title":"Interative Solution of Nonlinear Equations in Several Variables","author":"J.M. Ortega","year":"1970","unstructured":"Ortega, J.M., Rheinboldt, W.C.: Interative Solution of Nonlinear Equations in Several Variables. Academic Press, New York (1970)"},{"key":"9455_CR9","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-1-4613-3335-7_7","volume-title":"Advances in Nonlinear Programming","author":"J. Nocedal","year":"1998","unstructured":"Nocedal, J., Yuan, Y.X.: Combing trust region and line search techniques. In: Yuan, Y.X. (ed.) Advances in Nonlinear Programming, pp. 153\u2013175. Kluwer Academic, Dordrecht (1998)"},{"key":"9455_CR10","first-page":"447","volume":"100","author":"E.M. Gertz","year":"2004","unstructured":"Gertz, E.M.: A quasi-Newton trust region method. Math. Program., Ser. A 100, 447\u2013470 (2004)","journal-title":"Math. Program., Ser. A"},{"key":"9455_CR11","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 step size gradient methods. IMA J. Numer. Anal. 8, 141\u2013188 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"9455_CR12","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1137\/S1052623494266365","volume":"7","author":"M. Raydan","year":"1997","unstructured":"Raydan, M.: The Barzilai and Borwein method for the large-scale unconstrained minimization problem. SIAM J. Optim. 7, 26\u201333 (1997)","journal-title":"SIAM J. Optim."},{"key":"9455_CR13","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/A:1012903105391","volume":"103","author":"J. Sun","year":"2001","unstructured":"Sun, J., Zhang, J.P.: Global convergence of convergence of conjugate gradient methods without line search. Ann. Oper. Res. 103, 161\u2013173 (2001)","journal-title":"Ann. Oper. Res."},{"key":"9455_CR14","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.amc.2005.01.048","volume":"171","author":"J.T. Mo","year":"2005","unstructured":"Mo, J.T., Zhang, K.C., Wei, Z.X.: A nonmonotone trust region method for unconstrained optimization. Appl. Math. Comput. 171, 371\u2013384 (2005)","journal-title":"Appl. Math. Comput."},{"key":"9455_CR15","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/j.cam.2009.06.012","volume":"232","author":"Y.G. Ou","year":"2009","unstructured":"Ou, Y.G., Zhou, Q., Lin, H.C.: An ODE-based trust region method for unconstrained optimization problems. J. Comput. Appl. Math. 232, 318\u2013326 (2009)","journal-title":"J. Comput. Appl. Math."},{"key":"9455_CR16","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s00211-006-0021-6","volume":"104","author":"Z.H. Wang","year":"2006","unstructured":"Wang, Z.H., Yuan, Y.X.: A subspace implementation of quasi-Newton trust region methods for unconstrained optimization. Numer. Math. 104, 241\u2013269 (2006)","journal-title":"Numer. Math."},{"key":"9455_CR17","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/j.cam.2009.02.100","volume":"231","author":"Z.J. Shi","year":"2009","unstructured":"Shi, Z.J., Xu, Z.W.: The convergence of subspace trust region methods. J. Comput. Appl. Math. 231, 365\u2013377 (2009)","journal-title":"J. Comput. Appl. Math."},{"key":"9455_CR18","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s11081-008-9064-0","volume":"10","author":"Y.X. Yuan","year":"2009","unstructured":"Yuan, Y.X.: Subspace methods for large scale nonlinear equations and nonlinear least squares. Optim. Eng. 10, 207\u2013218 (2009)","journal-title":"Optim. Eng."},{"key":"9455_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1093\/imanum\/22.1.1","volume":"22","author":"Y.H. Dai","year":"2002","unstructured":"Dai, Y.H., Liao, L.Z.: R-linear convergence of the Barzilai and Borwein gradient method. IMA J. Numer. Anal. 22, 1\u201310 (2002)","journal-title":"IMA J. Numer. Anal."},{"key":"9455_CR20","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"D.C. 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":"9455_CR21","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01582063","volume":"63","author":"R. Byrd","year":"1994","unstructured":"Byrd, R., Nocedal, J., Schnabel, R.: Representations of quasi-Newton matrices and their use in limited memory methods. Math. Program. 63, 129\u2013156 (1994)","journal-title":"Math. Program."},{"key":"9455_CR22","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"J. More","year":"1981","unstructured":"More, J., Garbow, B., Hillstrom, K.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7, 17\u201341 (1981)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"9455_CR23","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."},{"key":"9455_CR24","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E.D. Dolan","year":"2002","unstructured":"Dolan, E.D., More, J.: Benchmarking optimization software with performance profiles. Math. Program., Ser. A 91, 201\u2013213 (2002)","journal-title":"Math. Program., Ser. A"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-012-9455-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-012-9455-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-012-9455-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:41Z","timestamp":1559288201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-012-9455-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,19]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["9455"],"URL":"https:\/\/doi.org\/10.1007\/s10589-012-9455-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,19]]}}}