{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T08:47:03Z","timestamp":1749804423083},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,3,24]],"date-time":"2012-03-24T00:00:00Z","timestamp":1332547200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s11075-012-9561-2","type":"journal-article","created":{"date-parts":[[2012,3,23]],"date-time":"2012-03-23T15:51:33Z","timestamp":1332517893000},"page":"263-277","source":"Crossref","is-referenced-by-count":10,"title":["Handling infeasibility in a large-scale nonlinear optimization algorithm"],"prefix":"10.1007","volume":"60","author":[{"given":"Jose Mario","family":"Mart\u00ednez","sequence":"first","affiliation":[]},{"given":"Leandro da Fonseca","family":"Prudente","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,3,24]]},"reference":[{"key":"9561_CR1","doi-asserted-by":"crossref","first-page":"1286","DOI":"10.1137\/060654797","volume":"18","author":"R Andreani","year":"2007","unstructured":"Andreani, R., Birgin, E.G., Mart\u00ednez, J.M., Schuverdt, M.L.: On augmented lagrangian methods with general lower-level constraints. SIAM J. Optim. 18, 1286\u20131309 (2007)","journal-title":"SIAM J. Optim."},{"key":"9561_CR2","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1080\/02331930903578700","volume":"60","author":"R Andreani","year":"2011","unstructured":"Andreani, R., Haeser, G., Mart\u00ednez, J.M.: On sequential optimality conditions for smooth constrained optimization. Optimization 60, 627\u2013641 (2011)","journal-title":"Optimization"},{"key":"9561_CR3","doi-asserted-by":"crossref","unstructured":"Andreani, R., Haeser, G., Schuverdt, M. L., Silva, P. J. S.: 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":"9561_CR4","doi-asserted-by":"crossref","unstructured":"Andreani, R., Haeser, G., Schuverdt, M.L., Silva, P.J.S.: Two new constraint qualifications and applications. Technical report, available in Optimization online (2011)","DOI":"10.1137\/110843939"},{"key":"9561_CR5","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s10957-004-1861-9","volume":"125","author":"R Andreani","year":"2005","unstructured":"Andreani, R., Mart\u00ednez, J.M., Schuverdt, M.L.: On the relation between the constant positive linear dependence condition and quasinormality constraint qualification. J. Optim. Theory Appl. 125, 473\u2013485 (2005)","journal-title":"J. Optim. Theory Appl."},{"key":"9561_CR6","doi-asserted-by":"crossref","first-page":"3533","DOI":"10.1137\/090777189","volume":"20","author":"R Andreani","year":"2010","unstructured":"Andreani, R., Mart\u00ednez, J.M., Svaiter, B.F.: A new sequential optimality condition for constrained optimization and algorithmic consequences. SIAM J. Optim. 20, 3533\u20133554 (2010)","journal-title":"SIAM J. Optim."},{"key":"9561_CR7","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1023\/A:1020533003783","volume":"23","author":"HY Benson","year":"2002","unstructured":"Benson, H.Y., Shanno, D.F., Vanderbei, R.J.: Interior-point methods for nonconvex nonlinear programming: filter methods and merit functions. Comput. Optim. Appl. 23, 257\u2013272 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"9561_CR8","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)","edition":"2"},{"key":"9561_CR9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1080\/10556780701577730","volume":"23","author":"EG Birgin","year":"2008","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: Improving ultimate convergence of an Augmented Lagrangian method. Optim Methods Softw 23, 177\u2013195 (2008)","journal-title":"Optim Methods Softw"},{"key":"9561_CR10","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1023\/A:1019928808826","volume":"23","author":"EG Birgin","year":"2002","unstructured":"Birgin, E.G., Mart\u00ednez J.M.: Large-scale active-set box-constrained optimization method with spectral projected gradients. Comput. Optim. Appl. 23, 101\u2013125 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"9561_CR11","doi-asserted-by":"crossref","first-page":"2281","DOI":"10.1137\/080738222","volume":"20","author":"RH Byrd","year":"2010","unstructured":"Byrd, R.H., Curtis, F.E. Nocedal, J.: Infeasibility detection and SQP methods for nonlinear optimization. SIAM J. Optim. 20, 2281\u20132299 (2010)","journal-title":"SIAM J. Optim."},{"key":"9561_CR12","first-page":"149185","volume":"89","author":"RH Byrd","year":"2000","unstructured":"Byrd, R.H., Gilbert, J.Ch., Nocedal, J.: A trust region method based on interior point techniques for nonlinear programming. Math. Program. 89, 149185 (2000)","journal-title":"Math. Program."},{"key":"9561_CR13","first-page":"3559","volume-title":"Large-Scale Nonlinear Optimization","author":"RH Byrd","year":"2006","unstructured":"Byrd, R.H., Nocedal, J., Waltz, R.A.: KNITRO: an integrated package for nonlinear optimization. In: Di Pillo, G., Roma, M. (eds.) Large-Scale Nonlinear Optimization, pp. 3559. Springer, New York (2006)"},{"key":"9561_CR14","volume-title":"MPS\/SIAM Series on Optimization","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, Ph.L.: Trust region methods. In: MPS\/SIAM Series on Optimization. SIAM, Philadelphia (2000)"},{"key":"9561_CR15","volume-title":"Optimal Quadratic Programming Algorithms","author":"Z Dost\u00e1l","year":"2009","unstructured":"Dost\u00e1l, Z.: Optimal Quadratic Programming Algorithms. Springer, New York (2009)"},{"key":"9561_CR16","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1137\/S1052623499362573","volume":"13","author":"Z Dost\u00e1l","year":"2003","unstructured":"Dost\u00e1l, Z., Friedlander, A., Santos, S.A.: Augmented Lagrangians with adaptive precision control for quadratic programming with simple bounds and equality constraints. SIAM J. Optim. 13, 1120\u20131140 (2003)","journal-title":"SIAM J. Optim."},{"key":"9561_CR17","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, Ph.L., W\u00e4chter, A.: Global convergence of trust-region SQP-filter algorithms for general nonlinear programming. SIAM J. Optim. 13, 635\u2013659 (2002)","journal-title":"SIAM J. Optim."},{"key":"9561_CR18","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."},{"key":"9561_CR19","first-page":"1","volume":"0926-6003","author":"R Fletcher","year":"2011","unstructured":"Fletcher, R., Leyffer, S., Toint, Ph.L.: On the global convergence of a filter-SQP algorithm. SIAM J. Optim. 13, 4459 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"9561_CR20","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/BF00940552","volume":"79","author":"WW Hager","year":"1993","unstructured":"Hager, W.W.: Analysis and implementation of a dual algorithm for constrained optimization. J. Optim. Theory Appl. 79, 427\u2013462 (1993)","journal-title":"J. Optim. Theory Appl."},{"key":"9561_CR21","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF00927673","volume":"4","author":"MR Hestenes","year":"1969","unstructured":"Hestenes, M.R.: Multiplier and gradient methods. J. Optim. Theory Appl. 4, 303\u2013320 (1969)","journal-title":"J. Optim. Theory Appl."},{"key":"9561_CR22","first-page":"283","volume-title":"Optimization","author":"MJD Powell","year":"1969","unstructured":"Powell, M.J.D.: A method for nonlinear constraints in minimization problems. In: Fletcher, R. (ed.) Optimization, pp. 283\u2013298. Academic Press, New York (1969)"},{"key":"9561_CR23","unstructured":"Prudente, L.F.: Augmented Lagrangian approaches in nonlinear programming. Doctoral dissertation, State University of Campinas (in preparation)"},{"key":"9561_CR24","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1137\/S1052623497326629","volume":"10","author":"L Qi","year":"2000","unstructured":"Qi, L., Wei, L. Qi, 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":"9561_CR25","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/0312021","volume":"12","author":"RT Rockafellar","year":"1974","unstructured":"Rockafellar, R.T.: Augmented Lagrange multiplier functions and duality in nonconvex programming. SIAM J. Control Optim. 12, 268\u2013285 (1974)","journal-title":"SIAM J. Control Optim."},{"key":"9561_CR26","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1590\/S1807-03022009000200003","volume":"28","author":"C Shen","year":"2009","unstructured":"Shen, C., Xue, W., Pu, D.: A filter SQP algorithm without a feasibility restoration phase. Comput. Appl. Math. 28, 167\u2013194 (2009)","journal-title":"Comput. Appl. Math."},{"key":"9561_CR27","doi-asserted-by":"crossref","unstructured":"Shen, C., Leyffer, S., Fletcher, R.: A nonmonotone filter method for nonlinear optimization. Comput. Optim. Appl. (2011). doi: 10.1007\/s10589-011-9430-2","DOI":"10.1007\/s10589-011-9430-2"},{"key":"9561_CR28","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."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-012-9561-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-012-9561-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-012-9561-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T19:45:30Z","timestamp":1641498330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-012-9561-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,24]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["9561"],"URL":"https:\/\/doi.org\/10.1007\/s11075-012-9561-2","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,24]]}}}