{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T07:26:04Z","timestamp":1762673164261,"version":"3.41.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Global Optimization"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1023\/a:1011983130559","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T11:29:09Z","timestamp":1040642949000},"page":"157-184","source":"Crossref","is-referenced-by-count":9,"title":["A Globally and Superlinearly Convergent SQP Algorithm for Nonlinear Constrained Optimization"],"prefix":"10.1007","volume":"21","author":[{"given":"Liqun","family":"Qi","sequence":"first","affiliation":[]},{"given":"Yu-Fei","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"356197_CR1","doi-asserted-by":"crossref","unstructured":"Boggs, P.T. and Tolle, J.W. (1995), Sequential quadratic programming, Acta Numerica, Cambridge University Press, 1995, pp. 1-51.","DOI":"10.1017\/S0962492900002518"},{"key":"356197_CR2","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0022-247X(89)90111-X","volume":"139","author":"J.V. Burke","year":"1989","unstructured":"Burke, J.V. (1989), A sequential quadratic programming algorithm for potentially infeasible mathematical programs, Journal of Mathematical Analysis and Applications 139: 319-351.","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"356197_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 sequential quadratic programming method, Mathematical Programming 43: 277-303.","journal-title":"Mathematical Programming"},{"key":"356197_CR4","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0802012","volume":"2","author":"R.H. Byrd","year":"1992","unstructured":"Byrd, R.H., Tapia, R.A. and Zhang, Y. (1992), An SQP augmented Lagrangian BFGS algorithm for constrained optimization, SIAM Journal on Optimization 2: 210-241.","journal-title":"SIAM Journal on Optimization"},{"key":"356197_CR5","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0167-6377(94)00059-F","volume":"17","author":"F. Facchinei","year":"1995","unstructured":"Facchinei, F. (1995), Minimization of SC\n1-functions and the Maratos effect, Operations Research Letters 17: 131-137.","journal-title":"Operations Research Letters"},{"key":"356197_CR6","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1023\/A:1022655423083","volume":"92","author":"F. Facchinei","year":"1997","unstructured":"Facchinei, F. (1997), Robust recursive quadratic programming algorithm model with global and superlinear convergence properties, Journal of Optimization Theory and Applications 92: 543-579.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"356197_CR7","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/BF01588240","volume":"17","author":"T. Glad","year":"1979","unstructured":"Glad, T. and Polak, E. (1979), A multiplier method with automatic limitation of penalty growth, Mathematical Programming 17: 140-155.","journal-title":"Mathematical Programming"},{"key":"356197_CR8","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-48320-2","volume-title":"Test examples for nonlinear programming codes","author":"W. Hock","year":"1981","unstructured":"Hock, W. and Schittkowski, K. (1981), Test examples for nonlinear programming codes, Lecture Notes in Economics and Mathematical Systems 187, Springer-Verlag, Berlin, New York."},{"key":"356197_CR9","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF01588976","volume":"14","author":"P.E. Gill","year":"1978","unstructured":"Gill, P.E. and Murray, W. (1978), Numerically stable methods for quadratic programming, Mathematical Programming 14: 349-372.","journal-title":"Mathematical Programming"},{"key":"356197_CR10","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1137\/0802027","volume":"2","author":"S. Lucidi","year":"1992","unstructured":"Lucidi, S. (1992), New results on a continuously differentiable penalty function, SIAM Journal on Optimization 2: 558-574.","journal-title":"SIAM Journal on Optimization"},{"key":"356197_CR11","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"J.J. Mor\u00e9","year":"1983","unstructured":"Mor\u00e9, J.J. and Sorensen, D.C. (1983), Computing a trust region step, SIAM Journal on Scientific and Statistical Computing 4: 553-572.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"356197_CR12","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1137\/0325051","volume":"25","author":"E.R. Panier","year":"1987","unstructured":"Panier, E.R. and Tits, A.L. (1987), A superlinearly convergent feasible method for the solution of inequality constrained optimization problems, SIAM Journal on Control and Optimization 25: 934-950.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"356197_CR13","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/BF00940684","volume":"69","author":"J.F.A. Pantoja","year":"1991","unstructured":"Pantoja, J.F.A. and Mayne, D.Q. (1991), Exact penalty function algorithm with simple updating of the penalty parameter, Journal of Optimization Theory and Applications 69: 441-467.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"356197_CR14","series-title":"Lecture Notes in Math.","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 nonlinearly constrained optimization calculations, in Numerical analysis, Proceedings, Biennial Conference, Dundee 1977, Lecture Notes in Math. 630, Springer-Verlag, Berlin, New York, pp. 144-157."},{"key":"356197_CR15","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01581275","volume":"58","author":"L. Qi","year":"1993","unstructured":"Qi, L. and Sun, J. (1993), A nonsmooth version of Newton's method, Mathematical Programming 58: 353-367.","journal-title":"Mathematical Programming"},{"key":"356197_CR16","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1287\/moor.5.1.43","volume":"5","author":"S.M. Robinson","year":"1980","unstructured":"Robinson, S.M. (1980), Strongly regular generalized equations, Mathematics of Operations Research 5: 43-62.","journal-title":"Mathematics of Operations Research"},{"key":"356197_CR17","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/BF01198402","volume":"47","author":"P. Spellucci","year":"1998","unstructured":"Spellucci, P. (1998), A new technique for inconsistent QP problems in the SQP methods, Mathematical Methods of Operations Research 47: 355-400.","journal-title":"Mathematical Methods of Operations Research"},{"key":"356197_CR18","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/BF02592051","volume":"26","author":"K. Tone","year":"1983","unstructured":"Tone, K. (1983), Revision of constraint approximations in the successive QP-method for nonlinear programming problems, Mathematical Programming 26: 144-152.","journal-title":"Mathematical Programming"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011983130559.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011983130559\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011983130559.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:40:31Z","timestamp":1751366431000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011983130559"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["356197"],"URL":"https:\/\/doi.org\/10.1023\/a:1011983130559","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}