{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T13:02:29Z","timestamp":1779800549747,"version":"3.53.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T00:00:00Z","timestamp":1763596800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T00:00:00Z","timestamp":1763596800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s12532-025-00295-x","type":"journal-article","created":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T08:10:29Z","timestamp":1763626229000},"page":"297-343","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A penalty-free method with nonmonotone line search for nonlinear optimization"],"prefix":"10.1007","volume":"18","author":[{"given":"Ting","family":"Xu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qi","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenhao","family":"Fu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhongwen","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,11,20]]},"reference":[{"key":"295_CR1","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, P.L.: CUTE: constrained and unconstrained testing environment. ACM Trans. Math. Softw. 21, 123\u2013160 (1995)","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"295_CR2","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1137\/120880045","volume":"24","author":"J Burke","year":"2014","unstructured":"Burke, J., Curtis, F., Wang, H.: A sequential quadratic optimization algorithm with rapid infeasibility detection. SIAM J. Optim. 24(2), 839\u2013872 (2014)","journal-title":"SIAM J. Optim."},{"key":"295_CR3","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/BF01582294","volume":"43","author":"J Burke","year":"1989","unstructured":"Burke, J., Han, S.: A robust sequential quadratic programming method. Math. Program. 43, 277\u2013303 (1989)","journal-title":"Math. Program."},{"key":"295_CR4","doi-asserted-by":"publisher","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, 39\u201373 (2012)","journal-title":"Math. Program."},{"key":"295_CR5","first-page":"1","volume":"16","author":"R Chamberlain","year":"1982","unstructured":"Chamberlain, R., Lamar\u00e9chal, C., Pedersen, H., Powell, M.: The watchdog technique for forcing convergence in algorithms for constrained optimization. Math. Program. 16, 1\u201317 (1982)","journal-title":"Math. Program."},{"key":"295_CR6","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."},{"key":"295_CR7","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/s10589-019-00117-6","volume":"76","author":"ZW Chen","year":"2020","unstructured":"Chen, Z.W., Dai, Y.H., Liu, J.Y.: A penalty-free method with superlinear convergence for equality constrained optimization. Comput. Optim. Appl. 76, 801\u2013833 (2020)","journal-title":"Comput. Optim. Appl."},{"key":"295_CR8","doi-asserted-by":"publisher","first-page":"3771","DOI":"10.1093\/imanum\/drab097","volume":"42","author":"ZW Chen","year":"2022","unstructured":"Chen, Z.W., Dai, Y.H., Zhang, T.Y.: A line search penalty-free SQP method for equality-constrained optimization without Maratos effect. IMA J. Numerical Analysis 42, 3771\u20133802 (2022)","journal-title":"IMA J. Numerical Analysis"},{"key":"295_CR9","unstructured":"Conn, A. R., Gould, N.I.M., Toint, Ph.L.: LANCELOT: A Fortran Package for Large-Scale Nonlinear Optimization (Release A), Springer Ser. Comput. Math. 17, Springer, New York(1992)"},{"key":"295_CR10","first-page":"335","volume":"4","author":"Y Dai","year":"2008","unstructured":"Dai, Y., Schittkowski, K.: A sequential quadratic programming algorithm with non-monotone line search. Pacific J. Optim. 4, 335\u2013351 (2008)","journal-title":"Pacific J. Optim."},{"key":"295_CR11","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/0710029","volume":"10","author":"J Daniel","year":"1973","unstructured":"Daniel, J.: On perturbations in systems of linear inequalities. SIAM J. Numer. Anal. 10, 299\u2013307 (1973)","journal-title":"SIAM J. Numer. Anal."},{"key":"295_CR12","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":"295_CR13","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":"295_CR14","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."},{"key":"295_CR15","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1137\/130920599","volume":"24","author":"NIM Gould","year":"2014","unstructured":"Gould, N.I.M., Loh, Y., Robinson, D.: A filter method with unified step computation for nonlinear optimization. SIAM J. Optim. 24, 175\u2013209 (2014)","journal-title":"SIAM J. Optim."},{"key":"295_CR16","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.: A Nonmonotone filter SQP method local convergence and numerical results. SIAM J. Optim. 25, 1885\u20131911 (2015)","journal-title":"SIAM J. Optim."},{"key":"295_CR17","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, P.: Nonlinear programming without a penalty function or a filter. Math. Program. 122, 155\u2013196 (2010)","journal-title":"Math. Program."},{"key":"295_CR18","doi-asserted-by":"publisher","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":"295_CR19","doi-asserted-by":"publisher","first-page":"3489","DOI":"10.1080\/00207160903124942","volume":"87","author":"C Gu","year":"2010","unstructured":"Gu, C., Zhu, D.T.: A nonmonotone SQP-filter method for equality constrained optimization. Inter J. Comput. Math. 87, 3489\u20133506 (2010)","journal-title":"Inter J. Comput. Math."},{"key":"295_CR20","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. Numer. Algor. 56, 537\u2013559 (2011)","journal-title":"Numer. Algor."},{"key":"295_CR21","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/s40314-014-0137-8","volume":"34","author":"M Huang","year":"2015","unstructured":"Huang, M., Pu, D.: A line search SQP method without a penalty or a filter. Comput. Appl. Math. 34, 741\u2013753 (2015)","journal-title":"Comput. Appl. Math."},{"issue":"2","key":"295_CR22","first-page":"241","volume":"49","author":"A Izmailov","year":"2009","unstructured":"Izmailov, A.: A new technique for avoiding the Maratos effect. Comput. Math. Math. Phy. 49(2), 241\u2013254 (2009)","journal-title":"Comput. Math. Math. Phy."},{"key":"295_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer-Verlag, New York, Inc (1999)"},{"key":"295_CR24","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1137\/0728063","volume":"28","author":"E Panier","year":"1991","unstructured":"Panier, E., Tits, A.: Avoiding the Maratos effect by means of a nonmonotone line search general constrained problems. SIAM J. Numer. Anal. 28, 1183\u20131195 (1991)","journal-title":"SIAM J. Numer. Anal."},{"key":"295_CR25","unstructured":"Powell, M.: Extensions to subroutine VF02AD. In System Modeling and Optimization, R. F. Drenick and F. Kozin, eds., Lecture Notes in Control and Inform. Sci., 38, Springer-Verlag, Berlin, New York(1982)"},{"key":"295_CR26","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF01588787","volume":"49","author":"M Powell","year":"1991","unstructured":"Powell, M., Yuan, Y.: A trust region algorithm for equality constrained optimization. Math. Program. 49, 189\u2013211 (1991)","journal-title":"Math. Program."},{"key":"295_CR27","doi-asserted-by":"publisher","first-page":"3201","DOI":"10.1016\/j.apm.2011.10.009","volume":"36","author":"SQ Qiu","year":"2012","unstructured":"Qiu, S.Q., Chen, Z.W.: Global and local convergence of a class of penalty-free-type methods for nonlinear programming. Appl. Math. Model. 36, 3201\u20133216 (2012)","journal-title":"Appl. Math. Model."},{"key":"295_CR28","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s10589-011-9430-2","volume":"52","author":"C Shen","year":"2012","unstructured":"Shen, C., Leyffer, S., Fletcher, R.: A nonmonotone filter method for nonlinear optimization. Comput. Optim. Appl. 52, 583\u2013607 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"295_CR29","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1080\/01630563.2013.814667","volume":"35","author":"C Shen","year":"2014","unstructured":"Shen, C., Shao, W., Xue, W.: On the local convergence of a penalty-function-free SQP method. Numer. Func. Anal. Optim. 35, 623\u2013647 (2014)","journal-title":"Numer. Func. Anal. Optim."},{"key":"295_CR30","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10589-014-9675-7","volume":"59","author":"C Shen","year":"2014","unstructured":"Shen, C., Zhang, L., Wang, B., Shao, W.: Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization. Comput. Optim. Appl. 59, 435\u2013473 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"295_CR31","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10107-003-0491-6","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."},{"key":"295_CR32","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, 103\u2013135 (2003)","journal-title":"Math. Program."},{"key":"295_CR33","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.cam.2008.09.031","volume":"228","author":"W Xue","year":"2009","unstructured":"Xue, W., Shen, C., Pu, D.: A penalty-function-free line search SQP method for nonlinear programming. J. Comput. Appl. Math. 228, 313\u2013325 (2009)","journal-title":"J. Comput. Appl. Math."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-025-00295-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12532-025-00295-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-025-00295-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T12:03:24Z","timestamp":1779797004000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12532-025-00295-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,20]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["295"],"URL":"https:\/\/doi.org\/10.1007\/s12532-025-00295-x","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,20]]},"assertion":[{"value":"7 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}