{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T11:15:58Z","timestamp":1784805358432,"version":"3.55.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T00:00:00Z","timestamp":1560902400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T00:00:00Z","timestamp":1560902400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871362"],"award-info":[{"award-number":["11871362"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11631013"],"award-info":[{"award-number":["11631013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005153","name":"National Funds for Distinguished Young Scientists","doi-asserted-by":"crossref","award":["11125107"],"award-info":[{"award-number":["11125107"]}],"id":[{"id":"10.13039\/501100005153","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National 973 Program of China","award":["2015CB856002"],"award-info":[{"award-number":["2015CB856002"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s10589-019-00117-6","type":"journal-article","created":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T14:02:38Z","timestamp":1560952958000},"page":"801-833","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A penalty-free method with superlinear convergence for equality constrained optimization"],"prefix":"10.1007","volume":"76","author":[{"given":"Zhongwen","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu-Hong","family":"Dai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiangyan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,6,19]]},"reference":[{"issue":"3","key":"117_CR1","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1137\/070679557","volume":"19","author":"RH Bielschowsky","year":"2008","unstructured":"Bielschowsky, R.H., Gomes, F.A.M.: Dynamic control of infeasibility in equality constrained optimization. SIAM J. Optim. 19(3), 1299\u20131325 (2008)","journal-title":"SIAM J. Optim."},{"key":"117_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0962492900002518","volume":"4","author":"PT Boggs","year":"1996","unstructured":"Boggs, P.T., Tolle, J.W.: Sequential quadratic programming. Acta Numer. 4, 1\u201351 (1996)","journal-title":"Acta Numer."},{"key":"117_CR3","doi-asserted-by":"publisher","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: CUTEr: constrained and unconstrained testing enviroment. ACM Trans. Math. Softw. 21, 123\u2013160 (1995)","journal-title":"ACM Trans. Math. Softw."},{"key":"117_CR4","doi-asserted-by":"publisher","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":"117_CR5","first-page":"1014","volume":"173","author":"ZW Chen","year":"2006","unstructured":"Chen, Z.W.: A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization. Appl. Math. Comput. 173, 1014\u20131046 (2006)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"117_CR6","doi-asserted-by":"crossref","first-page":"391","DOI":"10.3934\/jimo.2013.9.391","volume":"9","author":"ZW Chen","year":"2013","unstructured":"Chen, Z.W., Qiu, S.Q., Jiao, Y.J.: A penalty-free method for equality constrained optimization. J. Ind. Manag. Optim. 9(2), 391\u2013409 (2013)","journal-title":"J. Ind. Manag. Optim."},{"issue":"3","key":"117_CR7","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1080\/10556780600565489","volume":"22","author":"CM Chin","year":"2007","unstructured":"Chin, C.M., Rashid, A.H.A., Nor, K.M.: Global and local convergence of a filter line search method for nonlinear programming. Optim. Methods Softw. 22(3), 365\u2013390 (2007)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"117_CR8","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/0728030","volume":"28","author":"AR Conn","year":"1991","unstructured":"Conn, A.R., Gould, N.I.M., Toint, PhL: A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds. SIAM J. Numer. Anal. 28(2), 545\u2013572 (1991)","journal-title":"SIAM J. Numer. Anal."},{"key":"117_CR9","volume-title":"Trust-Region Methods, MPS-SIAM Series on Optimization","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-Region Methods, MPS-SIAM Series on Optimization. SIAM, Philadelphia (2000)"},{"key":"117_CR10","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"117_CR11","doi-asserted-by":"publisher","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."},{"key":"117_CR12","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BF01580879","volume":"35","author":"M Fukushima","year":"1986","unstructured":"Fukushima, M.: A successive quadratic programming algorithm with global and superlinear convergence properties. Math. Program. 35, 253\u2013264 (1986)","journal-title":"Math. Program."},{"key":"117_CR13","doi-asserted-by":"publisher","first-page":"9934","DOI":"10.1016\/j.apm.2013.05.037","volume":"37","author":"HW Ge","year":"2013","unstructured":"Ge, H.W., Chen, Z.W.: A penalty-free method with line search for nonlinear equality constrained optimization. Appl. Math. Model. 37, 9934\u20139949 (2013)","journal-title":"Appl. Math. Model."},{"issue":"3","key":"117_CR14","doi-asserted-by":"publisher","first-page":"1885","DOI":"10.1137\/140996677","volume":"25","author":"NIM Gould","year":"2015","unstructured":"Gould, N.I.M., Loh, Y., Robinson, D.P.: A nonmonotone filter SQP method: local convergence and numerical results. SIAM J. Optim. 25(3), 1885\u20131911 (2015)","journal-title":"SIAM J. Optim."},{"key":"117_CR15","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10107-008-0244-7","volume":"122","author":"NIM Gould","year":"2010","unstructured":"Gould, N.I.M., Toint, PhL: Nonlinear programming without a penalty function or a filter. Math. Program. 122, 155\u2013196 (2010)","journal-title":"Math. Program."},{"key":"117_CR16","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1016\/j.apm.2010.07.042","volume":"35","author":"C Gu","year":"2011","unstructured":"Gu, C., Zhu, D.T.: A secant algorithm with line search filter method for nonlinear optimization. Appl. Math. Model. 35, 879\u2013894 (2011)","journal-title":"Appl. Math. Model."},{"key":"117_CR17","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s40314-013-0109-4","volume":"34","author":"W Liu","year":"2015","unstructured":"Liu, W., Kong, F., Pu, D.G.: An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization. Comput. Appl. Math. 34, 141\u2013158 (2015)","journal-title":"Comput. Appl. Math."},{"issue":"2","key":"117_CR18","doi-asserted-by":"publisher","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":"117_CR19","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1023\/A:1017567113614","volume":"111","author":"JM Mart\u00ednez","year":"2001","unstructured":"Mart\u00ednez, J.M.: Inexact restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming. J. Optim. Theory Appl. 111, 39\u201358 (2001)","journal-title":"J. Optim. Theory Appl."},{"key":"117_CR20","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BFb0120947","volume":"16","author":"DQ Mayne","year":"1982","unstructured":"Mayne, D.Q., Polak, E.: A superlinearly convergent algorithm for constrained optimization problem. Math. Program. Study 16, 45\u201361 (1982)","journal-title":"Math. Program. Study"},{"key":"117_CR21","unstructured":"Omojokun E.O.: Trust region algorithms for optimization with nonlinear equality and inequality constraints. Ph.D. thesis, University of Colorado, Boulder, CO, USA (1989)"},{"issue":"4","key":"117_CR22","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1137\/1028154","volume":"28","author":"MJD Powell","year":"1986","unstructured":"Powell, M.J.D.: Convergence properties of algorithms for nonlinear optimization. SIAM Rev. 28(4), 487\u2013500 (1986)","journal-title":"SIAM Rev."},{"key":"117_CR23","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF01588787","volume":"49","author":"MJD Powell","year":"1991","unstructured":"Powell, M.J.D., Yuan, Y.X.: A trust region algorithm for equality constrained optimization. Math. Program. 49, 189\u2013211 (1991)","journal-title":"Math. Program."},{"key":"117_CR24","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10440-015-0013-6","volume":"142","author":"SQ Qiu","year":"2016","unstructured":"Qiu, S.Q., Chen, Z.W.: A globally convergent penalty-free method for optimization with equality constraints and simple bounds. Acta Appl. Math. 142, 39\u201360 (2016)","journal-title":"Acta Appl. Math."},{"issue":"1","key":"117_CR25","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/040603875","volume":"16","author":"C Sagastiz\u00e1bal","year":"2005","unstructured":"Sagastiz\u00e1bal, C., Solodov, M.: An infeasible bundle method for nonsmooth convex constrained optimization without a penalty function or a filter. SIAM J. Optim. 16(1), 146\u2013169 (2005)","journal-title":"SIAM J. Optim."},{"key":"117_CR26","doi-asserted-by":"publisher","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."},{"issue":"1","key":"117_CR27","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10107-002-0343-9","volume":"95","author":"M Ulbrich","year":"2003","unstructured":"Ulbrich, M., Ulbrich, S.: Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function. Math. Program. 95(1), 103\u2013135 (2003)","journal-title":"Math. Program."},{"key":"117_CR28","first-page":"217","volume":"100","author":"S Ulbrich","year":"2004","unstructured":"Ulbrich, S.: On the superlinear local convergence of a filter-SQP method. Math. Program. 100, 217\u2013245 (2004)","journal-title":"Math. Program."},{"issue":"1","key":"117_CR29","doi-asserted-by":"publisher","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(1), 32\u201348 (2005)","journal-title":"SIAM J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00117-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00117-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00117-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T05:23:09Z","timestamp":1663737789000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00117-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,19]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["117"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00117-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,19]]},"assertion":[{"value":"7 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}