{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:17:07Z","timestamp":1648617427957},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,8,1]],"date-time":"2010-08-01T00:00:00Z","timestamp":1280620800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1007\/s11424-010-7180-3","type":"journal-article","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T14:12:45Z","timestamp":1283955165000},"page":"861-872","source":"Crossref","is-referenced-by-count":2,"title":["The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems"],"prefix":"10.1007","volume":"23","author":[{"given":"Liying","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zengxin","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoping","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,9,9]]},"reference":[{"key":"7180_CR1","unstructured":"S. W. Cheng, Complexity science and systems engineering, in Conference of International Systems Science and Systems Engineering, 1998."},{"issue":"3","key":"7180_CR2","first-page":"1","volume":"23","author":"H.W. Zhang","year":"2004","unstructured":"H.W. Zhang, Y. F. Fu, and Z.G. Niu, Study on water treatment system\u2019s optimal operation model and its solution method, Journal of Tianjin Polytechnic University, 2004, 23(3): 1\u20134.","journal-title":"Journal of Tianjin Polytechnic University"},{"key":"7180_CR3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1023\/B:COAP.0000044184.25410.39","volume":"29","author":"Z. X. Wei","year":"2004","unstructured":"Z. X. Wei, G. H. Yu, G. L. Yuan, and Z. G. Lian, The superlinear convergence of a modified BFGStype method for unconstrained optimization, Computational Optimization and Applications, 2004, 29: 315\u2013332.","journal-title":"Computational Optimization and Applications"},{"key":"7180_CR4","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/BF00934961","volume":"10","author":"L. C. W. Dixon","year":"1972","unstructured":"L. C. W. Dixon, Variable metric algorithms: Necessary and sufficient conditions for identical behavior on nonquadratic functions, Journal of Optimization Theory and Applications, 1972, 10: 34\u201340.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"7180_CR5","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1093\/imamat\/7.1.21","volume":"7","author":"M. J. D. Powell","year":"1971","unstructured":"M. J. D. Powell, On the convergence of the variable metric algorithm, Journal of the Institute of Mathematics and Applications, 1971, 7: 21\u201336.","journal-title":"Journal of the Institute of Mathematics and Applications"},{"key":"7180_CR6","first-page":"53","volume":"9","author":"M. J. D. Powell","year":"1976","unstructured":"M. J. D. Powell, Some global convergence properties of a variable metric algorithm for minimization without exact line searches, SIAM Journal on Nonlinear Programming, 1976, 9: 53\u201372.","journal-title":"SIAM Journal on Nonlinear Programming"},{"key":"7180_CR7","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1137\/0724077","volume":"24","author":"R. Byrd","year":"1987","unstructured":"R. Byrd, J. Nocedal, and Y. X. Yuan, Global convergence of a class of quasi-Newton methods on convex problems, SIAM Journal on Numerical Analysis, 1987, 24: 1171\u20131190.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"7180_CR8","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1137\/0726042","volume":"26","author":"R. Byrd","year":"1989","unstructured":"R. Byrd and J. Nocedal, A tool for analysis of Quasi-Newton methods with application to unconstrained minimization, SIAM Journal on Numerical Analysis, 1989, 26: 727\u2013739.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"7180_CR9","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1093\/imanum\/8.4.487","volume":"8","author":"Y. Zhang","year":"1988","unstructured":"Y. Zhang and P. R. Tewarson, Quasi-Newton algorithem with updates from the preconvex part of Broyden\u2019s family, SIAM Journal on Numerical Analysis, 1988, 8: 487\u2013509.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"7180_CR10","first-page":"16","volume":"20","author":"D. H. Li","year":"1993","unstructured":"D. H. Li, On the global convergence of the DFP method, Journal of Hunan University: Natural Science, 1993, 20: 16\u201320.","journal-title":"Journal of Hunan University: Natural Science"},{"key":"7180_CR11","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01594933","volume":"50","author":"A. Griewank","year":"1991","unstructured":"A. Griewank, The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients, Mathematical Programming, 1991, 50: 141\u2013175.","journal-title":"Mathematical Programming"},{"key":"7180_CR12","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/BF02592063","volume":"36","author":"Ph. L. Toint","year":"1986","unstructured":"Ph. L. Toint, Global convergence of the partitioned BFGS algorithm for convex partially separable optimization, Mathematical Programming, 1986, 36: 290\u2013306.","journal-title":"Mathematical Programming"},{"key":"7180_CR13","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1137\/S1052623401383455","volume":"13","author":"Y. H. Dai","year":"2002","unstructured":"Y. H. Dai, Convergence properties of BFGS algorithm, SIAM Journal on Optimization, 2002, 13: 693\u2013701.","journal-title":"SIAM Journal on Optimization"},{"key":"7180_CR14","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0377-0427(00)00540-9","volume":"129","author":"D. H. Li","year":"2001","unstructured":"D. H. Li and M. Fukushima, A modified BFGS method and its global convergence in nonconvex minimization, Journal of Computational and Applied Mathematics, 2001, 129: 15\u201335.","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"7180_CR15","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1137\/S1052623499354242","volume":"11","author":"D. H. Li","year":"2001","unstructured":"D. H. Li and M. Fukushima, On the global convergence of BFGS method for nonconvex unconstrained optimization problems, SIAM Journal on Optimization, 2001, 11: 1054\u20131064.","journal-title":"SIAM Journal on Optimization"},{"key":"7180_CR16","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/A:1012903105391","volume":"103","author":"J. Sun","year":"2001","unstructured":"J. Sun and J. Zhang, Global convergence of conjugate gradient methods without line search, Annals of Operations Research, 2001, 103: 161\u2013173.","journal-title":"Annals of Operations Research"},{"key":"7180_CR17","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1016\/j.cam.2007.08.017","volume":"220","author":"L. Y. Liu","year":"2008","unstructured":"L. Y. Liu, S. W. Yao, and Z. W. Wei, The global and superlinear convergence of a new nonmonotone MBFGS algorithm on convex objective functions, Journal of Computational and Applied Mathematics, 2008, 220: 422\u2013438.","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"7180_CR18","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0771-050X(81)90002-4","volume":"7","author":"J. J. Mor\u00e9","year":"1981","unstructured":"J. J. Mor\u00e9, B. S. Garbow, and K. E. Hillstrome, Tested unconstrained optimization software, Applied Mathematics and Computation, 1981, 7: 17\u201341.","journal-title":"Applied Mathematics and Computation"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-010-7180-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-010-7180-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-010-7180-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:54:00Z","timestamp":1559400840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-010-7180-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["7180"],"URL":"https:\/\/doi.org\/10.1007\/s11424-010-7180-3","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8]]}}}