{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:08:45Z","timestamp":1725566925318},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642340611"},{"type":"electronic","value":"9783642340628"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34062-8_42","type":"book-chapter","created":{"date-parts":[[2012,9,7]],"date-time":"2012-09-07T08:52:58Z","timestamp":1347007978000},"page":"323-330","source":"Crossref","is-referenced-by-count":1,"title":["Modifying Feasible SQP Method for Inequality Constrained Optimization"],"prefix":"10.1007","author":[{"given":"Zhijun","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhibin","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guohua","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1137\/0726036","volume":"26","author":"P.T. Boggs","year":"1989","unstructured":"Boggs, P.T., Tolle, J.W.: A Strategy for Global Convergence in a Sequential Quadratic Programming Algorithm. SIAM J. Num. Anal.\u00a026, 600\u2013623 (1989)","journal-title":"SIAM J. Num. Anal."},{"key":"42_CR2","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF01580395","volume":"11","author":"S.P. Han","year":"1976","unstructured":"Han, S.P.: Superlinearly Convergent Variable Metric Algorithm for General Nonlinear Programming Problems. Mathematical Programming\u00a011, 263\u2013282 (1976)","journal-title":"Mathematical Programming"},{"key":"42_CR3","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/BFb0067703","volume-title":"Numerical Analysis","author":"M.J.D. Powell","year":"1978","unstructured":"Powell, M.J.D.: A Fast Algorithm for Nonlinearly Constrained Optimization Calculations. In: Waston, G.A. (ed.) Numerical Analysis, pp. 144\u2013157. Springer, Berlin (1978)"},{"key":"42_CR4","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF01581247","volume":"59","author":"E.R. Panier","year":"1993","unstructured":"Panier, E.R., Tits, A.L.: On Combining Feasibility, Descent and Superlinear Convergence in Inequality Constrained Optimization. Mathematical Programming\u00a059, 261\u2013276 (1993)","journal-title":"Mathematical Programming"},{"key":"42_CR5","first-page":"413","volume":"82","author":"P. Spellucci","year":"1998","unstructured":"Spellucci, P.: An SQP Method for General Nonlinear Programs Using Only Equality Constrained Subproblems. Mathematical Programming\u00a082, 413\u2013448 (1998)","journal-title":"Mathematical Programming"},{"key":"42_CR6","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1137\/S1052623498344562","volume":"11","author":"C.T. Lawarence","year":"2001","unstructured":"Lawarence, C.T., Tits, A.L.: A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm. SIAM J. Optim.\u00a011, 1092\u20131118 (2001)","journal-title":"SIAM J. Optim."},{"key":"42_CR7","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1023\/A:1014882909302","volume":"113","author":"L. Qi","year":"2002","unstructured":"Qi, L., Yang, Y.F.: Globally and Superlinearly Convergent QP-free Algorithm for Nonlinear Constrained Optimization. JOTA\u00a0113, 297\u2013323 (2002)","journal-title":"JOTA"},{"key":"42_CR8","doi-asserted-by":"publisher","first-page":"3956","DOI":"10.1016\/j.amc.2009.11.045","volume":"215","author":"Z.B. Zhu","year":"2010","unstructured":"Zhu, Z.B., Zhang, W.D., Geng, Z.J.: A feasible SQP method for nonlinear programming. Applied Mathematics and Computation\u00a0215, 3956\u20133969 (2010)","journal-title":"Applied Mathematics and Computation"},{"issue":"2","key":"42_CR9","first-page":"161","volume":"61","author":"Z.J. Luo","year":"2010","unstructured":"Luo, Z.J., Chen, G.H., Liang, J.L.: A variant of feasible descent SQP method for inequality constrained optimization. International Journal of Pure and Applied Mathematics\u00a061(2), 161\u2013168 (2010)","journal-title":"International Journal of Pure and Applied Mathematics"},{"issue":"4","key":"42_CR10","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s11075-010-9403-z","volume":"56","author":"C. Gu","year":"2011","unstructured":"Gu, C., Zhu, D.T.: A non-monotone line search multidimensional filter-SQP method for general nonlinear programming. Numerical Algorithms\u00a056(4), 537\u2013559 (2011)","journal-title":"Numerical Algorithms"},{"issue":"4","key":"42_CR11","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.3934\/jimo.2011.7.1041","volume":"7","author":"C.L. Hao","year":"2011","unstructured":"Hao, C.L., Liu, X.W.: A trust-region filter-SQP method for mathematical programs with linear complementarity constraints. Journal of Industrial and Management Optimization (JIMO)\u00a07(4), 1041\u20131055 (2011)","journal-title":"Journal of Industrial and Management Optimization (JIMO)"},{"issue":"1","key":"42_CR12","doi-asserted-by":"publisher","first-page":"19","DOI":"10.3934\/naco.2012.2.19","volume":"2","author":"C.L. Hao","year":"2012","unstructured":"Hao, C.L., Liu, X.W.: Globao convergence of an SQP algorithm for nonlinear optimization with overdetermined constraints. Numerical Algebra Control and Optimization\u00a02(1), 19\u201329 (2012)","journal-title":"Numerical Algebra Control and Optimization"},{"issue":"4","key":"42_CR13","first-page":"796","volume":"54","author":"J.F. Binnans","year":"1995","unstructured":"Binnans, J.F., Launay, G.: Sequential quadratic programming with penalization the displacement. SIAM J. Optimization\u00a054(4), 796\u2013812 (1995)","journal-title":"SIAM J. Optimization"},{"key":"42_CR14","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.camwa.2004.09.004","volume":"49","author":"J.B. Jian","year":"2005","unstructured":"Jian, J.B., Tang, C.M.: An SQP Feasible Descent Algorithm for Nonlinear Inequality Constrained Optimization Without Strict Complementarity. An International Journal Computers and Mathematics with Application\u00a049, 223\u2013238 (2005)","journal-title":"An International Journal Computers and Mathematics with Application"}],"container-title":["Lecture Notes in Computer Science","Information Computing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34062-8_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:43:32Z","timestamp":1620132212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34062-8_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642340611","9783642340628"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34062-8_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}