{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T09:46:19Z","timestamp":1751881579041,"version":"3.41.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"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":[[1997,9]]},"DOI":"10.1023\/a:1008255227457","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T13:47:34Z","timestamp":1040564854000},"page":"193-205","source":"Crossref","is-referenced-by-count":26,"title":["A Modified SQP Method and Its Global Convergence"],"prefix":"10.1007","volume":"11","author":[{"given":"Guanglu","family":"Zhou","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"111786_CR1","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, Mathematical Programming\n43, 277\u2013303.","journal-title":"Mathematical Programming"},{"issue":"3","key":"111786_CR2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00932858","volume":"22","author":"S.P. Han","year":"1977","unstructured":"Han, S.P. (1977), A Globally Convergent Method for Nonlinear Programming, Journal of Optimization Theory and Applications\n22(3), 297\u2013309.","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"3","key":"111786_CR3","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/BF00938444","volume":"45","author":"D.Q. Mayne","year":"1985","unstructured":"Mayne, D.Q. and Sahba, M. (1985), An Efficient Algorithm for Solving Inequalities, Journal of Optimization Theory and Applications\n45(3), 407\u2013424.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"111786_CR4","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/0377-2217(82)90110-2","volume":"11","author":"M.S. Bazaraa","year":"1982","unstructured":"Bazaraa, M.S. and Goode, J.J. (1982), An Algorithm for Solving Linearly Constraint Minimax Problems, European Journal of Operational Research\n11, 158\u2013166.","journal-title":"European Journal of Operational Research"},{"key":"111786_CR5","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"R.T. Rockafeller","year":"1970","unstructured":"Rockafeller, R.T. (1970), Convex analysis, Princeton University Press, Princeton, NJ."},{"issue":"2","key":"111786_CR6","first-page":"11","volume":"5","author":"G. Xue","year":"1991","unstructured":"Xue Guoliang (1991), Algorithm and Their Convergent Properties for Solving a Class of Linearly Constraint Minimax Problems, Comn. on Appl. Math. and comput. 5(2), 11\u201318.","journal-title":"Comn. on Appl. Math. and comput."},{"key":"111786_CR7","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 Convergent Variable Metric Algorithms for General Nonlinear Programming Problems, Mathematical Programming\n11, 263\u2013282.","journal-title":"Mathematical Programming"},{"key":"111786_CR8","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF01583780","volume":"23","author":"H Yamashita","year":"1982","unstructured":"Yamashita, H.(1982), A Globally Convergent Constrained Quasi-Newton Method with an Lagrangian Type Penalty Function, Mathematical Programming\n23, 75\u201386.","journal-title":"Mathematical Programming"},{"key":"111786_CR9","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 G.A. Watson, (ed.), Numerical Analysis; Springer-Verlag, Berlin, 144\u2013157."},{"issue":"1","key":"111786_CR10","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF00941316","volume":"47","author":"D.H. Martin","year":"1985","unstructured":"Martin, D.H. (1985), The Essence of Invexity, Journal of Optimization Theory and Applications\n47(1), 65\u201376.","journal-title":"Journal of Optimization Theory and Applications"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008255227457.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008255227457\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008255227457.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:45:01Z","timestamp":1751366701000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008255227457"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["111786"],"URL":"https:\/\/doi.org\/10.1023\/a:1008255227457","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}