{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T17:07:00Z","timestamp":1780333620804,"version":"3.54.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,7,16]],"date-time":"2014-07-16T00:00:00Z","timestamp":1405468800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s10589-014-9675-7","type":"journal-article","created":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T09:58:50Z","timestamp":1405418330000},"page":"435-473","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization"],"prefix":"10.1007","volume":"59","author":[{"given":"Chungen","family":"Shen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lei-Hong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenqiong","family":"Shao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,7,16]]},"reference":[{"issue":"4","key":"9675_CR1","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1137\/S1052623499359178","volume":"10","author":"M Anitescu","year":"2000","unstructured":"Anitescu, M.: Degenerate nonlinear programming with a quadratic growth condition. SIAM J. Optim. 10(4), 1116\u20131135 (2000)","journal-title":"SIAM J. Optim."},{"key":"9675_CR2","doi-asserted-by":"crossref","unstructured":"Andreani, R., Haeser, G., Schuverdt, M., Silva, P.: A relaxed constant positive linear dependence constraint qualification and applications. Math. Program. (2011). doi: 10.1007\/s10107-011-0456-0","DOI":"10.1007\/s10107-011-0456-0"},{"key":"9675_CR3","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s10957-004-1861-9","volume":"125","author":"R Andreani","year":"2005","unstructured":"Andreani, R., Martinez, J.M., Schuverdt, M.L.: On the relation between constant positive linear dependence condition and quasinormality constraint qualification. J. Optim. Theory Appl. 125, 473\u2013485 (2005)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"9675_CR4","doi-asserted-by":"crossref","first-page":"1299","DOI":"10.1137\/070679557","volume":"19","author":"RH Bielschowsky","year":"2008","unstructured":"Bielschowsky, R.H., Gomes, F.A.M.: Dynamical control of infeasibility in nonlinearly constrained optimization. SIAM J. Optim. 19(3), 1299\u20131325 (2008)","journal-title":"SIAM J. Optim."},{"key":"9675_CR5","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/200979.201043","volume":"21","author":"I Bongartz","year":"1995","unstructured":"Bongartz, I., Conn, A.R., Gould, N.I.M., Toint, PhL: CUTE: constrained and unconstrained testing environment. ACM Trans. Math. Softw. 21, 123\u2013160 (1995)","journal-title":"ACM Trans. Math. Softw."},{"key":"9675_CR6","volume-title":"Numerical Optimization: Theoretical and Practical Aspects","author":"JF Bonnans","year":"2006","unstructured":"Bonnans, J.F., Gilbert, JCh., Lemar\u00e9chal, C., Sagastiz\u00e1bal, C.: Numerical Optimization: Theoretical and Practical Aspects, 2nd edn. Springer, Berlin (2006)","edition":"2"},{"key":"9675_CR7","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1137\/0320014","volume":"20","author":"PT Boggs","year":"1982","unstructured":"Boggs, P.T., Tolle, J.W., Wang, P.: On the local convergence of quasi-newton methods for constrained optimization. SIAM J. Control Optim. 20, 161\u2013171 (1982)","journal-title":"SIAM J. Control Optim."},{"issue":"4","key":"9675_CR8","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1287\/moor.20.4.801","volume":"20","author":"JF Bonnans","year":"1995","unstructured":"Bonnans, J.F., Ioffe, A.: Second-order sufficiency and quadratic growth for nonisolated minima. Math. Oper. Res. 20(4), 801\u2013817 (1995)","journal-title":"Math. Oper. Res."},{"key":"9675_CR9","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01582294","volume":"43","author":"JV Burke","year":"1989","unstructured":"Burke, J.V., Han, S.P.: A robust sequential quadratic programming method. Math. Program. 43, 277\u2013303 (1989)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"9675_CR10","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10107-010-0408-0","volume":"133","author":"R Byrd","year":"2012","unstructured":"Byrd, R., Lopez-Calva, G., Nocedal, J.: A line search exact penalty method using steering rules. Math. Program. 133(1\u20132), 39\u201373 (2012)","journal-title":"Math. Program."},{"key":"9675_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0120945","volume":"16","author":"RM Chamberlain","year":"1982","unstructured":"Chamberlain, R.M., Powell, M.J.D., Lemarechal, C., Pedersen, H.C.: The watchdog technique for forcing convergence in algorithms for constrained optimization. Math. Program. Study 16, 1\u201317 (1982)","journal-title":"Math. Program. Study"},{"key":"9675_CR12","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"6","key":"9675_CR13","doi-asserted-by":"crossref","first-page":"3312","DOI":"10.1137\/090776664","volume":"20","author":"D Fern\u00e1ndez","year":"2010","unstructured":"Fern\u00e1ndez, D., Izmailov, A.F., Solodov, M.V.: Sharp primal superlinear convergence results for some Newtonian methods for constrained optimization. SIAM J. Optim. 20(6), 3312\u20133334 (2010)","journal-title":"SIAM J. Optim."},{"key":"9675_CR14","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s101070100244","volume":"91","author":"R Fletcher","year":"2002","unstructured":"Fletcher, R., Leyffer, S.: Nonlinear programming without a penalty function. Math. Program. 91, 239\u2013269 (2002)","journal-title":"Math. Program."},{"issue":"1","key":"9675_CR15","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1137\/S105262340038081X","volume":"13","author":"R Fletcher","year":"2002","unstructured":"Fletcher, R., Leyffer, S., Toint, PhL: On the global convergence of a filter-SQP algorithm. SIAM J. Optim. 13(1), 44\u201359 (2002)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9675_CR16","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1137\/110844362","volume":"22","author":"R Fletcher","year":"2012","unstructured":"Fletcher, R.: A sequential linear constraints programming algorithm for NLP. SIAM J. Optim. 22(3), 772\u2013794 (2012)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"9675_CR17","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1137\/S1052623499350013","volume":"12","author":"PE Gill","year":"2002","unstructured":"Gill, P.E., Murray, W., Saunders, M.A.: SNOPT: an SQP algorithm for large-scale constrained optimization. SIAM J. Optim. 12(4), 979\u20131006 (2002)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9675_CR18","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s10107-008-0244-7","volume":"122","author":"N Gould","year":"2010","unstructured":"Gould, N., Toint, PhL: Nonlinear programming without a penalty function or a filter. Math. Program. 122(1), 155\u2013196 (2010)","journal-title":"Math. Program."},{"key":"9675_CR19","unstructured":"Gould, N., Robinson, D.P., Toint, Ph.L.: Corrigendum: Nonlinear Programming Without a Penalty Function or a Filter. NAXYS Technical Report naxys-07-2011, Namur Center for Complex Systems (NAXYS) (2011)"},{"issue":"4","key":"9675_CR20","doi-asserted-by":"crossref","first-page":"2023","DOI":"10.1137\/080744542","volume":"20","author":"N Gould","year":"2010","unstructured":"Gould, N., Robinson, D.P.: A second derivative SQP method: global convergence. SIAM J. Optim. 20(4), 2023\u20132048 (2010)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"9675_CR21","doi-asserted-by":"crossref","first-page":"2049","DOI":"10.1137\/080744554","volume":"20","author":"N Gould","year":"2010","unstructured":"Gould, N., Robinson, D.P.: A second derivative SQP method: local convergence. SIAM J. Optim. 20(4), 2049\u20132079 (2010)","journal-title":"SIAM J. Optim."},{"key":"9675_CR22","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A nonmonotone line search technique for Newton\u2019s method. SIAM J. Numer. Anal. 23, 707\u2013716 (1986)","journal-title":"SIAM J. Numer. Anal."},{"key":"9675_CR23","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1008640419184","volume":"12","author":"WW Hager","year":"1999","unstructured":"Hager, W.W.: Stabilized sequential quadratic programming. Comput. Optim. Appl. 12, 253\u2013273 (1999)","journal-title":"Comput. Optim. Appl."},{"key":"9675_CR24","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01580395","volume":"11","author":"SP Han","year":"1976","unstructured":"Han, S.P.: Superlinearly convergent variable metric algorithms for general nonlinear programming problems. Math. Program. 11, 263\u2013282 (1976)","journal-title":"Math. Program."},{"key":"9675_CR25","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00932858","volume":"22","author":"SP Han","year":"1977","unstructured":"Han, S.P.: A globally convergent method for nonlinear programming. J. Optim. Theory Appl. 22, 297\u2013309 (1977)","journal-title":"J. Optim. Theory Appl."},{"key":"9675_CR26","volume-title":"Optimization Theory: The Finite-Dimensional Case","author":"MR Hestenes","year":"1975","unstructured":"Hestenes, M.R.: Optimization Theory: The Finite-Dimensional Case. Wiley, New York, NY (1975)"},{"key":"9675_CR27","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., Schittkowski, K.: Test Examples for Nonlinear Programming Codes. Springer, Berlin (1981)"},{"issue":"2","key":"9675_CR28","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/BF01586095","volume":"32","author":"J Kyparisis","year":"1984","unstructured":"Kyparisis, J.: On uniqueness of Kuhn\u2013Tucker multipliers in nonlinear programming. Math. Program. 32(2), 242\u2013246 (1984)","journal-title":"Math. Program."},{"issue":"2","key":"9675_CR29","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1137\/080739884","volume":"21","author":"XW Liu","year":"2011","unstructured":"Liu, X.W., Yuan, Y.X.: A sequential quadratic programming method without a penalty function or a filter for nonlinear equality constrained optimization. SIAM J. Optim. 21(2), 545\u2013571 (2011)","journal-title":"SIAM J. Optim."},{"key":"9675_CR30","doi-asserted-by":"crossref","unstructured":"Morales, J.L., Nocedal, J., Wu, Y.: A sequential quadratic programming algorithm with an additional equality constrained phase. IMA J. Numer. Anal. (2011). doi: 10.1093\/imanum\/drq037","DOI":"10.1093\/imanum\/drq037"},{"key":"9675_CR31","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization, 2nd edn. Springer, New York (2006)","edition":"2"},{"key":"9675_CR32","doi-asserted-by":"crossref","unstructured":"Powell, M.J.D.: A fast algorithm for nonlinearly constrained optimization calculations. In: Waston, G.A. (ed.) Numerical Analysis, Proceedings, Biennial Conference, Dundee 1977. Lecture Notes in Mathematics 630, pp. 144\u2013157. Springer, Berlin (1978)","DOI":"10.1007\/BFb0067703"},{"key":"9675_CR33","volume-title":"Mathematical Programming: The State of Art, Bonn, 1982","author":"MJD Powell","year":"1983","unstructured":"Powell, M.J.D.: Variable metric methods for constrained optimization. In: Bachem, A., Grotschel, M., Korte, B. (eds.) Mathematical Programming: The State of Art, Bonn, 1982. Springer, Berlin (1983)"},{"key":"9675_CR34","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1137\/S1052623497326629","volume":"10","author":"L Qi","year":"2000","unstructured":"Qi, L., Wei, Z.: On the constant positive linear dependence condition and its application to SQP methods. SIAM J. Optim. 10, 963\u2013981 (2000)","journal-title":"SIAM J. Optim."},{"key":"9675_CR35","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s10589-011-9430-2","volume":"52","author":"CG Shen","year":"2012","unstructured":"Shen, C.G., Leyffer, S., Fletcher, R.: A nonmonotone filter method for nonlinear optimization. Comput. Optim. Appl. 52, 583\u2013607 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"9675_CR36","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s10107-002-0343-9","volume":"95","author":"M Ulbrich","year":"2003","unstructured":"Ulbrich, M., Ulbrich, S.: Nonmonotone trust-region methods for nonlinear equality constrained optimization without a penalty function. Math. Program. 95, 103\u2013135 (2003)","journal-title":"Math. Program."},{"issue":"3","key":"9675_CR37","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1018665102534","volume":"11","author":"SJ Wright","year":"1998","unstructured":"Wright, S.J.: Superlinear convergence of a stabilized SQP method to a degenerate solution. Comput. Optim. Appl. 11(3), 253\u2013275 (1998)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"9675_CR38","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1137\/S1052623498333731","volume":"13","author":"SJ Wright","year":"2002","unstructured":"Wright, S.J.: Modifying SQP for degenerate problems. SIAM J. Optim. 13(2), 470\u2013497 (2002)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9675_CR39","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s10107-002-0344-8","volume":"95","author":"SJ Wright","year":"2003","unstructured":"Wright, S.J.: Constraint identification and algorithm stabilization for degenerate nonlinear programs. Math. Program. 95(1), 137\u2013160 (2003)","journal-title":"Math. Program."},{"issue":"3","key":"9675_CR40","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/030601235","volume":"15","author":"SJ Wright","year":"2005","unstructured":"Wright, S.J.: An algorithm for degenerate nonlinear programming with rapid local convergence. SIAM J. Optim. 15(3), 673\u2013696 (2005)","journal-title":"SIAM J. Optim."},{"key":"9675_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S1052623403426556","volume":"16","author":"A W\u00e4chter","year":"2005","unstructured":"W\u00e4chter, A., Biegler, L.T.: Line search filter methods for nonlinear programming: motivation and global convergence. SIAM J. Optim. 16, 1\u201331 (2005)","journal-title":"SIAM J. Optim."},{"key":"9675_CR42","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1137\/S1052623403426544","volume":"16","author":"A W\u00e4chter","year":"2005","unstructured":"W\u00e4chter, A., Biegler, L.T.: Line search filter methods for nonlinear programming: local convergence. SIAM J. Optim. 16, 32\u201348 (2005)","journal-title":"SIAM J. Optim."},{"key":"9675_CR43","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106, 25\u201357 (2006)","journal-title":"Math. Program."},{"issue":"1","key":"9675_CR44","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.cam.2008.09.031","volume":"228","author":"WJ Xue","year":"2009","unstructured":"Xue, W.J., Shen, C.G., Pu, D.G.: A penalty-function-free line search SQP method for nonlinear programming. J. Comput. Appl. Math. 228(1), 313\u2013325 (2009)","journal-title":"J. Comput. Appl. Math."},{"key":"9675_CR45","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1023\/A:1011942228555","volume":"21","author":"JL Zhang","year":"2001","unstructured":"Zhang, J.L., Zhang, X.S.: A modified SQP method with nonmonotone linsearch technique. J. Glob. Optim. 21, 201\u2013218 (2001)","journal-title":"J. Glob. Optim."},{"key":"9675_CR46","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1023\/A:1008255227457","volume":"11","author":"GL Zhou","year":"1997","unstructured":"Zhou, G.L.: A modified SQP method and its global convergence. J. Glob. Optim. 11, 193\u2013205 (1997)","journal-title":"J. Glob. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-014-9675-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-014-9675-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-014-9675-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T20:46:30Z","timestamp":1565642790000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-014-9675-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,16]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["9675"],"URL":"https:\/\/doi.org\/10.1007\/s10589-014-9675-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,16]]}}}