{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:05:39Z","timestamp":1758823539750},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,8,3]],"date-time":"2007-08-03T00:00:00Z","timestamp":1186099200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1007\/s10898-007-9219-0","type":"journal-article","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T15:51:49Z","timestamp":1186069909000},"page":"203-217","source":"Crossref","is-referenced-by-count":15,"title":["A globally and superlinearly convergent modified SQP-filter method"],"prefix":"10.1007","volume":"41","author":[{"given":"Ke","family":"Su","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,8,3]]},"reference":[{"key":"9219_CR1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1137\/0320014","volume":"20","author":"P.T. Boggs","year":"1982","unstructured":"Boggs P.T., Tolle J.W. and Wang P. (1982). On the local convergence of quasi-newton methods for constrained optimization. SIAM J. Control Optim. 20: 161\u2013171","journal-title":"Control Optim."},{"key":"9219_CR2","doi-asserted-by":"crossref","first-page":"1187","DOI":"10.1137\/0729072","volume":"29","author":"J.F. Bonnons","year":"1992","unstructured":"Bonnons J.F., Painer E.R., Titts A.L. and Zhou J.L. (1992). Avoiding the Maratos effect by means of nonmontone linesearch, Inequality constrained problems-feasible iterates. SIAM J. Numer. Anal. 29: 1187\u20131202","journal-title":"SIAM J. Numer. Anal."},{"key":"9219_CR3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01582294","volume":"43","author":"J.V. Burke","year":"1989","unstructured":"Burke J.V. and Han S.P. (1989). A robust SQP method. Math. Program. 43: 277\u2013303","journal-title":"Math. Program."},{"key":"9219_CR4","volume-title":"Mathematical Theory of Optimization","author":"D.Z. Du","year":"2001","unstructured":"Du D.Z., Pardalos P.M. and Wu W.L. (2001). Mathematical Theory of Optimization. Kluwer Academic Publishers, Boston"},{"key":"9219_CR5","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF02192227","volume":"85","author":"F. Facchinei","year":"1995","unstructured":"Facchinei F. and Lucidi S. (1995). Quadraticly and superlinearly convergent for the solution of inequality constrained optimization problem. J. Optim. Theory Appl. 85: 265\u2013289","journal-title":"J. Optim. Theory Appl."},{"key":"9219_CR6","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s101070100244","volume":"91","author":"R. Fletcher","year":"2002","unstructured":"Fletcher R. and Leyffer S. (2002). Nonlinear programming without a penalty function. Math. Program. 91: 239\u2013269","journal-title":"Math. Program."},{"key":"9219_CR7","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1137\/S105262340038081X","volume":"13","author":"R. Fletcher","year":"2002","unstructured":"Fletcher R., Leyffer S. and Toint P.L. (2002). On the global convergence of a filter-SQP algorithm. SIAM J. Optim. 13: 44\u201359","journal-title":"SIAM J. Optim."},{"key":"9219_CR8","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1137\/S1052623499357258","volume":"13","author":"R. Fletcher","year":"2002","unstructured":"Fletcher R., Gould N.I.M., Leyffer S., Toint P.L. and Wachter A. (2002). Global convergence of a trust region SQP-filter algorithm for general nonlinear programming. SIAM J. Optim. 13: 635\u2013660","journal-title":"SIAM J. Optim."},{"key":"9219_CR9","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01580395","volume":"11","author":"S.P. Han","year":"1976","unstructured":"Han S.P. (1976). Superlinearly convergence variable metric algorithm for general nonlinear programming problems. Math. Program. 11: 263\u2013282","journal-title":"Math. Program."},{"key":"9219_CR10","first-page":"1000","volume":"172","author":"P.Y. Nie","year":"2006","unstructured":"Nie P.Y. and Ma C.F. (2006). A trust region filter mehtod for general nonlinear programming. Appl. Math. Comput. 172: 1000\u20131017","journal-title":"Appl. Math. Comput."},{"key":"9219_CR11","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/BFb0067703","volume-title":"Numerical Analysis.","author":"M.J.D. Powell","year":"1978","unstructured":"Powell M.J.D. (1978). A fast algorithm for nonlinear constrained optimization calculations. In: Waston, G.A. (eds) Numerical Analysis., pp 144\u2013157. Springer-Verlag, Berlin"},{"key":"9219_CR12","doi-asserted-by":"crossref","unstructured":"Powell, M.J.D.: Variable metric methods for constrained optimization. In: Bachen, A., et al. (eds.) Mathematical Programming-The state of Art. Springer-Verlag, Berlin (1982)","DOI":"10.1007\/978-3-642-68874-4_12"},{"key":"9219_CR13","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1023\/A:1011942228555","volume":"21","author":"J.L. Zhang","year":"2001","unstructured":"Zhang J.L. and Zhang X.S. (2001). A modified SQP method with nonmonotone linesearch technique. J. Global Optim. 21: 201\u2013218","journal-title":"J. Global Optim."},{"key":"9219_CR14","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1023\/A:1008255227457","volume":"11","author":"G.L. Zhou","year":"1997","unstructured":"Zhou G.L. (1997). A modified SQP method and its global convergence. J. Global Optim. 11: 193\u2013205","journal-title":"J. Global Optim."},{"key":"9219_CR15","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s001860300299","volume":"58","author":"Z.B. Zhu","year":"2003","unstructured":"Zhu Z.B., Zhang K.C. and Jian J.B. (2003). An improved SQP algorithm for inequality constrained optimization. Math. Methods Oper. Res. 58: 271\u2013282","journal-title":"Math. Methods Oper. Res."},{"key":"9219_CR16","first-page":"519","volume":"168","author":"Z.B. Zhu","year":"2005","unstructured":"Zhu Z.B. (2005). A globally and superlinearly convergent feasible QP-free method for nonlinear programming. Appl. Math. Comput. 168: 519\u2013539","journal-title":"Appl. Math. Comput."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-007-9219-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-007-9219-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-007-9219-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T12:12:09Z","timestamp":1559304729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-007-9219-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,3]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["9219"],"URL":"https:\/\/doi.org\/10.1007\/s10898-007-9219-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8,3]]}}}