{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:26:53Z","timestamp":1766269613508,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,12,21]],"date-time":"2019-12-21T00:00:00Z","timestamp":1576886400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,21]],"date-time":"2019-12-21T00:00:00Z","timestamp":1576886400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"crossref","award":["2013\/05475-7"],"award-info":[{"award-number":["2013\/05475-7"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo<\/","doi-asserted-by":"publisher","award":["2016\/02092-8"],"award-info":[{"award-number":["2016\/02092-8"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s10107-019-01454-4","type":"journal-article","created":{"date-parts":[[2019,12,21]],"date-time":"2019-12-21T08:03:22Z","timestamp":1576915402000},"page":"257-288","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods"],"prefix":"10.1007","volume":"186","author":[{"given":"Gabriel","family":"Haeser","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5077-0359","authenticated-orcid":false,"given":"Oliver","family":"Hinder","sequence":"additional","affiliation":[]},{"given":"Yinyu","family":"Ye","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,21]]},"reference":[{"issue":"1\u20134","key":"1454_CR1","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1080\/10556789908805754","volume":"11","author":"A Altman","year":"1999","unstructured":"Altman, A., Gondzio, J.: Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization. Optim. Methods Softw. 11(1\u20134), 275\u2013302 (1999)","journal-title":"Optim. Methods Softw."},{"key":"1454_CR2","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-1-4757-3216-0_8","volume":"33","author":"ED Andersen","year":"2000","unstructured":"Andersen, E.D., Andersen, K.D.: The mosek interior point optimizer for linear programming: an implementation of the homogeneous algorithm. High Perform. Optim. 33, 197\u2013232 (2000)","journal-title":"High Perform. Optim."},{"issue":"3","key":"1454_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1023\/A:1018369223322","volume":"10","author":"ED Andersen","year":"1998","unstructured":"Andersen, E.D., Ye, Y.: A computational study of the homogeneous algorithm for large-scale convex optimization. Comput. Optim. Appl. 10(3), 243\u2013269 (1998)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1454_CR4","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s101070050027","volume":"84","author":"ED Andersen","year":"1999","unstructured":"Andersen, E.D., Ye, Y.: On a homogeneous algorithm for the monotone complementarity problem. Math. Program. 84(2), 375\u2013399 (1999)","journal-title":"Math. Program."},{"key":"1454_CR5","doi-asserted-by":"publisher","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 (2012a)","journal-title":"SIAM J. Optim."},{"key":"1454_CR6","doi-asserted-by":"publisher","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. Program. 135, 255\u2013273 (2012b)","journal-title":"Math. Program."},{"issue":"1","key":"1454_CR7","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1137\/15M1008488","volume":"26","author":"R Andreani","year":"2016","unstructured":"Andreani, R., Mart\u00ednez, J.M., Ramos, A., Silva, P.J.S.: A cone-continuity constraint qualification and algorithmic consequences. SIAM J. Optim. 26(1), 96\u2013110 (2016)","journal-title":"SIAM J. Optim."},{"key":"1454_CR8","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2017.0879","author":"R Andreani","year":"2018","unstructured":"Andreani, R., Mart\u00ednez, J.M., Ramos, A., Silva, P.J.S.: Strict constraint qualifications and sequential optimality conditions for constrained optimization. Math. Oper. Res. (2018). https:\/\/doi.org\/10.1287\/moor.2017.0879","journal-title":"Math. Oper. Res."},{"issue":"6","key":"1454_CR9","doi-asserted-by":"publisher","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(6), 3533\u20133554 (2010)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"1454_CR10","doi-asserted-by":"publisher","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(5), 627\u2013641 (2011)","journal-title":"Optimization"},{"key":"1454_CR11","volume-title":"Practical methods of optimization: theory and algorithms","author":"MS Bazaraa","year":"2006","unstructured":"Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Practical methods of optimization: theory and algorithms. Wiley, Hoboken, New Jersey (2006)"},{"key":"1454_CR12","unstructured":"Benson, H.Y., Shanno, D.F., Vanderbei, R.J.: Interior-point methods for nonconvex nonlinear programming: Complementarity constraints. Operations Res. Financ. Eng. pp. 1\u201320 (2002)"},{"issue":"1","key":"1454_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s11081-008-9040-8","volume":"10","author":"J Burgschweiger","year":"2009","unstructured":"Burgschweiger, J., Gn\u00e4dig, B., Steinbach, M.C.: Optimization models for operative planning in drinking water networks. Optim. Eng. 10(1), 43\u201373 (2009)","journal-title":"Optim. Eng."},{"issue":"1","key":"1454_CR14","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/PL00011391","volume":"89","author":"RH Byrd","year":"2000","unstructured":"Byrd, R.H., Gilbert, J.C., Nocedal, J.: A trust region method based on interior point techniques for nonlinear programming. Math. Program. 89(1), 149\u2013185 (2000)","journal-title":"Math. Program."},{"issue":"1","key":"1454_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-005-0701-5","volume":"108","author":"L Chen","year":"2006","unstructured":"Chen, L., Goldfarb, D.: Interior-point $$\\ell _2$$-penalty methods for nonlinear programming with strong global convergence properties. Math. Program. 108(1), 1\u201336 (2006)","journal-title":"Math. Program."},{"issue":"2","key":"1454_CR16","doi-asserted-by":"publisher","first-page":"295","DOI":"10.2307\/1907852","volume":"20","author":"G Debreu","year":"1952","unstructured":"Debreu, G.: Definite and semidefinite quadratic forms. Econometrica (pre-1986) 20(2), 295 (1952)","journal-title":"Econometrica (pre-1986)"},{"issue":"2","key":"1454_CR17","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1137\/15M1020575","volume":"59","author":"I Dunning","year":"2017","unstructured":"Dunning, I., Huchette, J., Lubin, M.: Jump: a modeling language for mathematical optimization. SIAM Rev. 59(2), 295\u2013320 (2017)","journal-title":"SIAM Rev."},{"issue":"3","key":"1454_CR18","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/BF02275347","volume":"89","author":"AS El-Bakry","year":"1996","unstructured":"El-Bakry, A.S., Tapia, R.A., Tsuchiya, T., Zhang, Y.: On the formulation and theory of the newton interior-point method for nonlinear programming. J. Optim. Theory Appl. 89(3), 507\u2013541 (1996)","journal-title":"J. Optim. Theory Appl."},{"key":"1454_CR19","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/BF01593777","volume":"12","author":"J Gauvin","year":"1977","unstructured":"Gauvin, J.: A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming. Math. Program. 12, 136\u2013138 (1977)","journal-title":"Math. Program."},{"issue":"1","key":"1454_CR20","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/s10957-016-0986-y","volume":"171","author":"G Giorgi","year":"2016","unstructured":"Giorgi, G., Jim\u00e9nez, B., Novo, V.: Approximate Karush-Kuhn-Tucker condition in multiobjective optimization. J. Optim. Theory Appl. 171(1), 70\u201389 (2016)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1454_CR21","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10589-010-9361-3","volume":"51","author":"J Gondzio","year":"2012","unstructured":"Gondzio, J.: Matrix-free interior point method. Comput. Optim. Appl. 51(2), 457\u2013480 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1454_CR22","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01580610","volume":"60","author":"O G\u00fcler","year":"1993","unstructured":"G\u00fcler, O., Ye, Y.: Convergence behavior of interior-point algorithms. Math. Program. 60(1), 215\u2013228 (1993)","journal-title":"Math. Program."},{"issue":"2","key":"1454_CR23","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s10589-018-0005-3","volume":"70","author":"G Haeser","year":"2018","unstructured":"Haeser, G.: A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms. Comput. Optim. Appl. 70(2), 615\u2013639 (2018)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"1454_CR24","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/s10957-011-9802-x","volume":"149","author":"G Haeser","year":"2011","unstructured":"Haeser, G., Schuverdt, M.L.: On approximate KKT condition and its extension to continuous variational inequalities. J. Optim. Theory Appl. 149(3), 528\u2013539 (2011)","journal-title":"J. Optim. Theory Appl."},{"key":"1454_CR25","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10898-014-0186-y","volume":"59","author":"WW Hager","year":"2014","unstructured":"Hager, W.W., Mico-Umutesi, D.: Error estimation in nonlinear optimization. J. Global Optim. 59, 327\u2013341 (2014)","journal-title":"J. Global Optim."},{"key":"1454_CR26","unstructured":"Hinder, O., Ye, Y.: A one-phase interior point method for nonconvex optimization (2018) . arXiv preprint arXiv:1801.03072"},{"issue":"2","key":"1454_CR27","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1137\/S1052623402417699","volume":"14","author":"V Jeyakumar","year":"2003","unstructured":"Jeyakumar, V., Lee, G.M., Dinh, N.: New sequential lagrange multiplier conditions characterizing optimality without constraint qualification for convex programs. SIAM J. Optim. 14(2), 534\u2013547 (2003). https:\/\/doi.org\/10.1137\/S1052623402417699","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1454_CR28","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1137\/040621065","volume":"17","author":"S Leyffer","year":"2006","unstructured":"Leyffer, S., L\u00f3pez-Calva, G., Nocedal, J.: Interior methods for mathematical programs with complementarity constraints. SIAM J. Optim. 17(1), 52\u201377 (2006)","journal-title":"SIAM J. Optim."},{"issue":"1\u20133","key":"1454_CR29","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF01588785","volume":"49","author":"IJ Lustig","year":"1990","unstructured":"Lustig, I.J.: Feasibility issues in a primal-dual interior-point method for linear programming. Math. Program. 49(1\u20133), 145\u2013162 (1990)","journal-title":"Math. Program."},{"issue":"1","key":"1454_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/ijoc.6.1.1","volume":"6","author":"IJ Lustig","year":"1994","unstructured":"Lustig, I.J., Marsten, R.E., Shanno, D.F.: Interior point methods for linear programming: computational state of the art. ORSA J. Comput. 6(1), 1\u201314 (1994)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"1454_CR31","doi-asserted-by":"publisher","first-page":"101","DOI":"10.2140\/pjm.1980.88.101","volume":"88","author":"L McLinden","year":"1980","unstructured":"McLinden, L.: An analogue of Moreau\u2019s proximation theorem, with application to the nonlinear complementarity problem. Pac. J. Math. 88(1), 101\u2013161 (1980)","journal-title":"Pac. J. Math."},{"key":"1454_CR32","doi-asserted-by":"crossref","unstructured":"Megiddo, N.: Pathways to the optimal set in linear programming. In: Progress in Mathematical Programming. Springer, pp. 131\u2013158 (1989)","DOI":"10.1007\/978-1-4613-9617-8_8"},{"issue":"4","key":"1454_CR33","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S Mehrotra","year":"1992","unstructured":"Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2(4), 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1454_CR34","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1287\/moor.20.1.135","volume":"20","author":"S Mizuno","year":"1995","unstructured":"Mizuno, S., Todd, M.J., Ye, Y.: A surface of analytic centers and primal-dual infeasible-interior-point algorithms for linear programming. Math. Oper. Res. 20(1), 135\u2013162 (1995)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1454_CR35","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","volume":"108","author":"Y Nesterov","year":"2006","unstructured":"Nesterov, Y., Polyak, B.T.: Cubic regularization of newton method and its global performance. Math. Program. 108(1), 177\u2013205 (2006)","journal-title":"Math. Program."},{"key":"1454_CR36","volume-title":"Numer. Optim.","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numer. Optim. Springer, Berlin (2006)"},{"key":"1454_CR37","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1137\/S1052623497326629","volume":"10","author":"L Qi","year":"2000","unstructured":"Qi, L., Wei, Z.: On the constant positive linear dependence conditions and its application to SQP methods. SIAM J. Optim. 10, 963\u2013981 (2000)","journal-title":"SIAM J. Optim."},{"key":"1454_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets\u00a0R, J.-B.: Variational Analysis. Springer, Berlin (1998)"},{"key":"1454_CR39","doi-asserted-by":"crossref","unstructured":"Sonnevend, G.: An \u201canalytical centre\u201d for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming. In: System Modelling And Optimization. Springer, pp. 866\u2013875 (1986)","DOI":"10.1007\/BFb0043914"},{"issue":"3","key":"1454_CR40","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1023\/A:1019798502851","volume":"22","author":"LN Vicente","year":"2002","unstructured":"Vicente, L.N., Wright, S.J.: Local convergence of a primal-dual method for degenerate nonlinear programming. Comput. Optim. Appl. 22(3), 311\u2013328 (2002)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1454_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S1052623403426556","volume":"16","author":"A W\u00e4chter","year":"2005","unstructured":"W\u00e4chter, A., Biegler, L.T.: Line search filter methods for nonlinear programming: motivation and global convergence. SIAM J. Optim. 16(1), 1\u201331 (2005)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1454_CR42","doi-asserted-by":"publisher","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(1), 25\u201357 (2006)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"1454_CR43","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/BF01585182","volume":"62","author":"Y Ye","year":"1993","unstructured":"Ye, Y., Anstreicher, K.: On quadratic and $${O}(\\sqrt{n}{L})$$ convergence of a predictor-corrector algorithm for LCP. Math. Program. 62(1\u20133), 537\u2013551 (1993)","journal-title":"Math. Program."},{"issue":"1","key":"1454_CR44","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1287\/moor.19.1.53","volume":"19","author":"Y Ye","year":"1994","unstructured":"Ye, Y., Todd, M.J., Mizuno, S.: An $${O}(\\sqrt{n}{L})$$-iteration homogeneous and self-dual linear programming algorithm. Math. Oper. Res. 19(1), 53\u201367 (1994)","journal-title":"Math. Oper. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01454-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-019-01454-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01454-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,11]],"date-time":"2021-02-11T09:47:03Z","timestamp":1613036823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-019-01454-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,21]]},"references-count":44,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["1454"],"URL":"https:\/\/doi.org\/10.1007\/s10107-019-01454-4","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2019,12,21]]},"assertion":[{"value":"7 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}