{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T11:09:08Z","timestamp":1744196948252},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,8,14]],"date-time":"2014-08-14T00:00:00Z","timestamp":1407974400000},"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":[[2015,4]]},"DOI":"10.1007\/s10589-014-9685-5","type":"journal-article","created":{"date-parts":[[2014,8,13]],"date-time":"2014-08-13T20:24:25Z","timestamp":1407961465000},"page":"609-631","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Optimality properties of an Augmented Lagrangian method on infeasible problems"],"prefix":"10.1007","volume":"60","author":[{"given":"E. G.","family":"Birgin","sequence":"first","affiliation":[]},{"given":"J. M.","family":"Mart\u00ednez","sequence":"additional","affiliation":[]},{"given":"L. F.","family":"Prudente","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,14]]},"reference":[{"key":"9685_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":"9685_CR2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10107-006-0077-1","volume":"111","author":"R Andreani","year":"2008","unstructured":"Andreani, R., Birgin, E.G., Mart\u00ednez, J.M., Schuverdt, M.L.: Augmented Lagrangian methods under the constant positive linear dependence constraint qualification. Math. Programm. 111, 5\u201332 (2008)","journal-title":"Math. Programm."},{"key":"9685_CR3","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":"9685_CR4","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10107-011-0456-0","volume":"135","author":"R Andreani","year":"2012","unstructured":"Andreani, R., Haeser, G., Schuverdt, M.L., Silva, P.J.S.: A relaxed constant positive linear dependence constraint qualification and applications. Math. Programm. 135, 255\u2013273 (2012)","journal-title":"Math. Programm."},{"key":"9685_CR5","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1137\/110843939","volume":"22","author":"R Andreani","year":"2012","unstructured":"Andreani, R., Haeser, G., Schuverdt, M.L., Silva, P.J.S.: Two new weak constraint qualifications and applications. SIAM J. Optim. 22, 1109\u20131135 (2012)","journal-title":"SIAM J. Optim."},{"key":"9685_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":"9685_CR7","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s11075-009-9289-9","volume":"53","author":"M Andretta","year":"2010","unstructured":"Andretta, M., Birgin, E.G., Mart\u00ednez, J.M.: Partial spectral projected gradient method with active-set strategy for linearly constrained optimization. Numer. Algorithms 53, 23\u201352 (2010)","journal-title":"Numer. Algorithms"},{"key":"9685_CR8","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/040603371","volume":"17","author":"C Audet","year":"2006","unstructured":"Audet, C., Dennis Jr, J.E.: Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17, 188\u2013217 (2006)","journal-title":"SIAM J. Optim."},{"key":"9685_CR9","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1137\/070692662","volume":"20","author":"C Audet","year":"2009","unstructured":"Audet, C., Dennis Jr, J.E.: A progressive barrier for derivative-free nonlinear programming. SIAM J. Optim. 20, 445\u2013472 (2009)","journal-title":"SIAM J. Optim."},{"key":"9685_CR10","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":"9685_CR11","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1137\/080714488","volume":"31","author":"E Berg van den","year":"2008","unstructured":"van den Berg, E., Friedlander, M.P.: Probing the Pareto frontier for basis pursuit solutions. SIAM J. Sci. Comput. 31, 890\u2013912 (2008)","journal-title":"SIAM J. Sci. Comput."},{"key":"9685_CR12","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s10589-005-1066-7","volume":"31","author":"EG Birgin","year":"2005","unstructured":"Birgin, E.G., Castillo, R., Mart\u00ednez, J.M.: Numerical comparison of Augmented Lagrangian algorithms for nonconvex problems. Comput. Optim. Appl. 31, 31\u201355 (2005)","journal-title":"Comput. Optim. Appl."},{"key":"9685_CR13","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.1080\/10556788.2011.556634","volume":"27","author":"EG Birgin","year":"2012","unstructured":"Birgin, E.G., Fern\u00e1ndez, D., Mart\u00ednez, J.M.: The boundedness of penalty parameters in an Augmented Lagrangian method with constrained subproblems. Optim. Methods Softw. 27, 1001\u20131024 (2012)","journal-title":"Optim. Methods Softw."},{"key":"9685_CR14","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s10107-009-0264-y","volume":"125","author":"EG Birgin","year":"2010","unstructured":"Birgin, E.G., Floudas, C.A., Mart\u00ednez, J.M.: Global minimization using an Augmented Lagrangian method with variable lower-level constraints. Math. Programm. 125, 139\u2013162 (2010)","journal-title":"Math. Programm."},{"key":"9685_CR15","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":"9685_CR16","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":"9685_CR17","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10898-013-0039-0","volume":"58","author":"EG Birgin","year":"2014","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Prudente, L.F.: Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming. J. Glob. Optim. 58, 207\u2013242 (2014)","journal-title":"J. Glob. Optim."},{"key":"9685_CR18","doi-asserted-by":"crossref","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Prudente, L.F.: Optimality properties of an Augmented Lagrangian method on infeasible problems, Technical Report MCDO 070714, Department of Computer Science, Institute of Mathematics and Statistics, University of S\u00e3o Paulo http:\/\/www.ime.usp.br\/egbirgin\/ (2014)","DOI":"10.1007\/s10589-014-9685-5"},{"key":"9685_CR19","doi-asserted-by":"crossref","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"EG Birgin","year":"2000","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Optim. 10, 1196\u20131211 (2000)","journal-title":"SIAM J. Optim."},{"key":"9685_CR20","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":"9685_CR21","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/PL00011391","volume":"89","author":"RH Byrd","year":"2000","unstructured":"Byrd, R.H., Gilbert, JCh., Nocedal, J.: A trust region method based on interior point techniques for nonlinear programming. Math. Programm. 89, 149\u2013185 (2000)","journal-title":"Math. Programm."},{"key":"9685_CR22","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/0-387-30065-1_4","volume-title":"Large-Scale Nonlinear Optim.","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 Optim., pp. 35\u201359. Springer, US (2006)"},{"key":"9685_CR23","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719857","volume-title":"Trust Region Methods. MPS\/SIAM Series on Optimization","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, PhL: Trust Region Methods. MPS\/SIAM Series on Optimization. SIAM, Philadelphia (2000)"},{"key":"9685_CR24","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":"9685_CR25","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":"9685_CR26","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1109\/JSTSP.2007.910281","volume":"1","author":"MA Figueiredo","year":"2007","unstructured":"Figueiredo, M.A., Nowak, R.D., Wright, S.J.: Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems. IEEE J. Sel. Topics Signal Process. 1, 586\u2013597 (2007)","journal-title":"IEEE J. Sel. Topics Signal Process."},{"key":"9685_CR27","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, PhL, 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":"9685_CR28","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. Programm. 91, 239\u2013269 (2002)","journal-title":"Math. Programm."},{"key":"9685_CR29","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, 44\u201359 (2002)","journal-title":"SIAM J. Optim."},{"key":"9685_CR30","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"NIM Gould","year":"2003","unstructured":"Gould, N.I.M., Orban, D., Toint, PhL: CUTEr and SifDec: a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw 29, 373\u2013394 (2003)","journal-title":"ACM Trans. Math. Softw"},{"key":"9685_CR31","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":"9685_CR32","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10107-009-0288-3","volume":"126","author":"S Lu","year":"2009","unstructured":"Lu, S.: Implications of the constant rank constraint qualification. Math. Programm. 126, 365\u2013392 (2009)","journal-title":"Math. Programm."},{"key":"9685_CR33","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1080\/02331934.2010.527972","volume":"61","author":"S Lu","year":"2012","unstructured":"Lu, S.: Relation between the constant rank and the relaxed constant rank constraint qualifications. Optimization 61, 555\u2013566 (2012)","journal-title":"Optimization"},{"key":"9685_CR34","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s11075-012-9561-2","volume":"60","author":"JM Mart\u00ednez","year":"2012","unstructured":"Mart\u00ednez, J.M., Prudente, L.F.: Handling infeasibility in a large-scale nonlinear optimization algorithm. Numer. Algorithms 60, 263\u2013277 (2012)","journal-title":"Numer. Algorithms"},{"key":"9685_CR35","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1080\/02331930902971377","volume":"60","author":"L Minchenko","year":"2011","unstructured":"Minchenko, L., Stakhovski, S.: On relaxed constant rank regularity conditions in mathematical programming. Optimization 60, 429\u2013440 (2011)","journal-title":"Optimization"},{"key":"9685_CR36","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1137\/090761318","volume":"1","author":"L Minchenko","year":"2011","unstructured":"Minchenko, L., Stakhovski, S.: Parametric nonlinear programming problems under the relaxed constant rank condition. SIAM J. Optim. 1, 314\u2013332 (2011)","journal-title":"SIAM J. Optim."},{"key":"9685_CR37","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":"9685_CR38","volume-title":"Augmented Lagrangian approaches in Nonlinear Programming, Doctoral Dissertation Campinas","author":"LF Prudente","year":"2012","unstructured":"Prudente, L.F.: Augmented Lagrangian approaches in Nonlinear Programming, Doctoral Dissertation Campinas. State University of Campinas, Campinas (2012)"},{"key":"9685_CR39","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":"9685_CR40","doi-asserted-by":"crossref","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":"9685_CR41","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":"9685_CR42","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. Programm. 106, 25\u201357 (2006)","journal-title":"Math. Programm."},{"key":"9685_CR43","unstructured":"http:\/\/www.ime.usp.br\/~egbirgin\/tango\/"},{"key":"9685_CR44","unstructured":"http:\/\/www.ime.unicamp.br\/~martinez\/"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-014-9685-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-014-9685-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-014-9685-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,14]],"date-time":"2022-04-14T11:40:16Z","timestamp":1649936416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-014-9685-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,14]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["9685"],"URL":"https:\/\/doi.org\/10.1007\/s10589-014-9685-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,14]]}}}