{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:24:51Z","timestamp":1763641491758},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,10,29]],"date-time":"2011-10-29T00:00:00Z","timestamp":1319846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s10589-011-9430-2","type":"journal-article","created":{"date-parts":[[2011,10,28]],"date-time":"2011-10-28T17:25:44Z","timestamp":1319822744000},"page":"583-607","source":"Crossref","is-referenced-by-count":31,"title":["A nonmonotone filter method for nonlinear optimization"],"prefix":"10.1007","volume":"52","author":[{"given":"Chungen","family":"Shen","sequence":"first","affiliation":[]},{"given":"Sven","family":"Leyffer","sequence":"additional","affiliation":[]},{"given":"Roger","family":"Fletcher","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,10,29]]},"reference":[{"issue":"4","key":"9430_CR1","doi-asserted-by":"crossref","first-page":"980","DOI":"10.1137\/S105262340138983X","volume":"14","author":"C. Audet","year":"2004","unstructured":"Audet, C., Dennis, J., Jr.: A pattern search filter method for nonlinear programming without derivatives. SIAM J. Optim. 14(4), 980\u20131010 (2004)","journal-title":"SIAM J. Optim."},{"key":"9430_CR2","unstructured":"Benson, H., Vanderbei, R.: Cute models in AMPL (1998). http:\/\/orfe.princeton.edu\/rvdb\/ampl\/nlmodels\/cute\/"},{"key":"9430_CR3","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, P.L.: CUTE: constrained and unconstrained testing environment. ACM Trans. Math. Softw. 21, 123\u2013160 (1995)","journal-title":"ACM Trans. Math. Softw."},{"key":"9430_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0120945","volume":"16","author":"R.M. Chamberlain","year":"1982","unstructured":"Chamberlain, R.M., Powell, M.J.D., Lemarechal, C., Petersen, H.C.: The watchdog technique for forcing convergence in algorithms for constrained optimization. Math. Program. Stud. 16, 1\u201317 (1982)","journal-title":"Math. Program. Stud."},{"issue":"1","key":"9430_CR5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10107-003-0378-6","volume":"96","author":"C.M. Chin","year":"2003","unstructured":"Chin, C.M., Fletcher, R.: On the global convergence of an SLP-filter algorithm that takes EQP steps. Math. Program. 96(1), 161\u2013177 (2003)","journal-title":"Math. Program."},{"key":"9430_CR6","series-title":"MPS-SIAM Series on Optimization","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-Region Methods","author":"A.R. 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)"},{"issue":"2","key":"9430_CR7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E.D. Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"9430_CR8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF02192227","volume":"85","author":"F. Facchinei","year":"1995","unstructured":"Facchinei, F., Lucidi, S.: Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems. J. Optim. Theory Appl. 85, 265\u2013289 (1995)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"9430_CR9","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s101070050113","volume":"87","author":"R. Fletcher","year":"2000","unstructured":"Fletcher, R.: Stable reduced Hessian updates for indefinite quadratic programming. Math. Program. 87(2), 251\u2013264 (2000)","journal-title":"Math. Program."},{"key":"9430_CR10","unstructured":"Fletcher, R., Leyffer, S.: User manual for filterSQP. Numerical Analysis Report NA\/181, University of Dundee (1998)"},{"key":"9430_CR11","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\u2013270 (2002)","journal-title":"Math. Program."},{"key":"9430_CR12","first-page":"259","volume-title":"High Performance Algorithms and Software for Nonlinear Optimization","author":"R. Fletcher","year":"2003","unstructured":"Fletcher, R., Leyffer, S.: Filter-type algorithms for solving systems of algebraic equations and inequalities. In: di Pillo, G., Murli, A. (eds.) High Performance Algorithms and Software for Nonlinear Optimization, pp. 259\u2013278. Kluwer Academic, Dordrecht (2003)"},{"issue":"3","key":"9430_CR13","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1137\/S1052623499357258","volume":"13","author":"R. Fletcher","year":"2002","unstructured":"Fletcher, R., Gould, N.I.M., Leyffer, S., Toint, P.L., W\u00e4chter, A.: Global convergence of trust-region SQP-filter algorithms for general nonlinear programming. SIAM J. Optim. 13(3), 635\u2013659 (2002)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9430_CR14","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1137\/S105262340038081X","volume":"13","author":"R. Fletcher","year":"2002","unstructured":"Fletcher, R., Leyffer, S., Toint, P.L.: On the global convergence of a filter-SQP algorithm. SIAM J. Optim. 13(1), 44\u201359 (2002)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9430_CR15","first-page":"2","volume":"18","author":"R. Fletcher","year":"2007","unstructured":"Fletcher, R., Leyffer, S., Toint, P.L.: A brief history of filter methods. SIAG\/OPT Views-and-News 18(1), 2\u201312 (2007)","journal-title":"SIAG\/OPT Views-and-News"},{"key":"9430_CR16","volume-title":"AMPL: A Modelling Language for Mathematical Programming","author":"R. Fourer","year":"2003","unstructured":"Fourer, R., Gay, D.M., Kernighan, B.W.: AMPL: A Modelling Language for Mathematical Programming, 2nd edn. Books\/Cole Thomson Learning, New York (2003)","edition":"2"},{"issue":"3","key":"9430_CR17","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1137\/S1052623401399320","volume":"14","author":"C.C. Gonzaga","year":"2003","unstructured":"Gonzaga, C.C., Karas, E.W., Vanti, M.: A globally convergent filter method for nonlinear programming. SIAM J. Optim. 14(3), 646\u2013669 (2003)","journal-title":"SIAM J. Optim."},{"key":"9430_CR18","unstructured":"Gould, N.I.M., Toint, P.L.: Global convergence of a non-monotone trust-region SQP-filter algorithm for nonlinear programming. Numerical Analysis Report RAL-TR-2003-003, Rutherford Appleton Laboratory, UK (2003). Available online at www.numerical.rl.ac.uk\/reports\/reports.shtml"},{"key":"9430_CR19","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s101070050047","volume":"85","author":"C. Kanzow","year":"1999","unstructured":"Kanzow, C., Qi, H.-D.: A QP-free constrained Newton-type method for variational inequality problems. Math. Program. 85, 81\u2013106 (1999)","journal-title":"Math. Program."},{"key":"9430_CR20","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s10107-007-0123-7","volume":"116","author":"E.W. Karas","year":"2009","unstructured":"Karas, E.W., Ribeiro, A., Sagastiz\u00e1bal, C., Solodov, M.: A bundle-filter method for nonsmooth convex constrained optimization. Math. Program. 116, 297\u2013320 (2009)","journal-title":"Math. Program."},{"key":"9430_CR21","unstructured":"Maratos, N.: Exact penalty function algorithms for finite dimensional and control optimization problems. Ph.D. thesis, Univ. of London (1978)"},{"key":"9430_CR22","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"J.J. Mor\u00e9","year":"1983","unstructured":"Mor\u00e9, J.J., Sorensen, D.C.: Computing a trust region step. SIAM J. Sci. Stat. Comput. 4, 553\u2013572 (1983)","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"1","key":"9430_CR23","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1137\/S1052623499353935","volume":"11","author":"H.D. Qi","year":"2000","unstructured":"Qi, H.D., Qi, L.Q.: A new QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization. SIAM J. Optim. 11(1), 113\u2013132 (2000)","journal-title":"SIAM J. Optim."},{"key":"9430_CR24","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.1137\/060672285","volume":"19","author":"A. Ribeiro","year":"2008","unstructured":"Ribeiro, A., Karas, E.W., Gonzaga, C.C.: Global convergence of filter methods for nonlinear programming. SIAM J. Optim. 19, 1231\u20131249 (2008)","journal-title":"SIAM J. Optim."},{"key":"9430_CR25","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1287\/moor.5.1.43","volume":"5","author":"S.M. Robinson","year":"1980","unstructured":"Robinson, S.M.: Strongly regular generalized equations. Math. Oper. Res. 5, 43\u201362 (1980)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"9430_CR26","doi-asserted-by":"crossref","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(1), 217\u2013245 (2004)","journal-title":"Math. Program."},{"issue":"1","key":"9430_CR27","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.: Line search filter methods for nonlinear programming: local convergence. SIAM J. Optim. 16(1), 32\u201348 (2005)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9430_CR28","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.: Line search filter methods for nonlinear programming: motivation and global convergence. SIAM J. Optim. 16(1), 1\u201331 (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-011-9430-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-011-9430-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9430-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:41Z","timestamp":1559302601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-011-9430-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,29]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["9430"],"URL":"https:\/\/doi.org\/10.1007\/s10589-011-9430-2","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,29]]}}}