{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:14:16Z","timestamp":1772295256312,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10957-017-1071-x","type":"journal-article","created":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T12:18:30Z","timestamp":1485951510000},"page":"523-547","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["A Mixed Logarithmic Barrier-Augmented Lagrangian Method for Nonlinear Optimization"],"prefix":"10.1007","volume":"173","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8821-5799","authenticated-orcid":false,"given":"Paul","family":"Armand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riadh","family":"Omheni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,1]]},"reference":[{"issue":"1, Ser. A","key":"1071_CR1","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(1, Ser. A), 25\u201357 (2006)","journal-title":"Math. Program."},{"issue":"1","key":"1071_CR2","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/S0036144504446096","volume":"47","author":"PE Gill","year":"2005","unstructured":"Gill, P.E., Murray, W., Saunders, M.A.: SNOPT: an SQP algorithm for large-scale constrained optimization. SIAM Rev. 47(1), 99\u2013131 (2005)","journal-title":"SIAM Rev."},{"issue":"1, Ser. A","key":"1071_CR3","doi-asserted-by":"crossref","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, Ser. A), 149\u2013185 (2000)","journal-title":"Math. Program."},{"key":"1071_CR4","unstructured":"Shanno, D.F., Vanderbei, R.J.: Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods. Math. Program. 87(2, Ser. B), 303\u2013316 (2000). Studies in algorithmic optimization"},{"key":"1071_CR5","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611973365","volume-title":"Practical Augmented Lagrangian Methods for Constrained Optimization. Fundamental of Algorithms","author":"EG Birgin","year":"2014","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: Practical Augmented Lagrangian Methods for Constrained Optimization. Fundamental of Algorithms. SIAM Publications, Philadelphia (2014)"},{"key":"1071_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-12211-2","volume-title":"LANCELOT: A Fortran Package for Large-Scale Nonlinear Optimization (Release A), Springer Series in Computational Mathematics","author":"AR Conn","year":"1992","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: LANCELOT: A Fortran Package for Large-Scale Nonlinear Optimization (Release A), Springer Series in Computational Mathematics, vol. 17. Springer, Berlin (1992)"},{"issue":"3","key":"1071_CR7","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1080\/1055678031000098773","volume":"18","author":"M Ko\u010dvara","year":"2003","unstructured":"Ko\u010dvara, M., Stingl, M.: Pennon: a code for convex nonlinear and semidefinite programming. Optim. Methods Softw. 18(3), 317\u2013333 (2003)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"1071_CR8","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10589-014-9679-3","volume":"59","author":"P Armand","year":"2014","unstructured":"Armand, P., Benoist, J., Omheni, R., Pateloup, V.: Study of a primal-dual algorithm for equality constrained minimization. Comput. Optim. Appl. 59(3), 405\u2013433 (2014)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1071_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10556788.2015.1025401","volume":"31","author":"P Armand","year":"2017","unstructured":"Armand, P., Omheni, R.: A globally and quadratically convergent primal-dual augmented Lagrangian algorithm for equality constrained optimization. Optim. Methods Softw. 31(1), 1\u201321 (2017)","journal-title":"Optim. Methods Softw."},{"issue":"1, Ser. A","key":"1071_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-005-0701-5","volume":"108","author":"L Chen","year":"2006","unstructured":"Chen, L., Goldfarb, D.: Interior-point $$l_2$$ l 2 -penalty methods for nonlinear programming with strong global convergence properties. Math. Program. 108(1, Ser. A), 1\u201336 (2006)","journal-title":"Math. Program."},{"issue":"1","key":"1071_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10589-010-9339-1","volume":"51","author":"PE Gill","year":"2012","unstructured":"Gill, P.E., Robinson, D.P.: A primal-dual augmented Lagrangian. Comput. Optim. Appl. 51(1), 1\u201325 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"1071_CR12","doi-asserted-by":"crossref","first-page":"1983","DOI":"10.1137\/120882913","volume":"23","author":"PE Gill","year":"2013","unstructured":"Gill, P.E., Robinson, D.P.: A globally convergent stabilized SQP method. SIAM J. Optim. 23(4), 1983\u20132010 (2013)","journal-title":"SIAM J. Optim."},{"key":"1071_CR13","unstructured":"Omheni, R.: M\u00e9thodes primales-duales r\u00e9gularis\u00e9es pour l\u2019optimisation non lin\u00e9aire avec contraintes. Ph.D. thesis, University of Limoges, France (2014)"},{"issue":"2","key":"1071_CR14","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1137\/S1052623499355533","volume":"14","author":"H Yamashita","year":"2003","unstructured":"Yamashita, H., Yabe, H.: An interior point method with a primal-dual quadratic barrier penalty function for nonlinear optimization. SIAM J. Optim. 14(2), 479\u2013499 (2003)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"1071_CR15","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1080\/10556788.2012.668905","volume":"28","author":"P Armand","year":"2013","unstructured":"Armand, P., Benoist, J., Orban, D.: From global to local convergence of interior methods for nonlinear optimization. Optim. Methods Softw. 28(5), 1051\u20131080 (2013)","journal-title":"Optim. Methods Softw."},{"issue":"3, Ser. A","key":"1071_CR16","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/PL00011386","volume":"88","author":"A W\u00e4chter","year":"2000","unstructured":"W\u00e4chter, A., Biegler, L.T.: Failure of global convergence for a class of interior point methods for nonlinear programming. Math. Program. 88(3, Ser. A), 565\u2013574 (2000)","journal-title":"Math. Program."},{"key":"1071_CR17","volume-title":"Numerical Optimization. Springer Series in Operations Research and Financial Engineering","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer Series in Operations Research and Financial Engineering, 2nd edn. Springer, New York (2006)","edition":"2"},{"issue":"1\u20132, Ser. A","key":"1071_CR18","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s10107-011-0498-3","volume":"137","author":"P Armand","year":"2013","unstructured":"Armand, P., Benoist, J.: Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods. Math. Program. 137(1\u20132, Ser. A), 587\u2013592 (2013)","journal-title":"Math. Program."},{"issue":"4","key":"1071_CR19","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1137\/S0036144502414942","volume":"44","author":"A Forsgren","year":"2002","unstructured":"Forsgren, A., Gill, P.E., Wright, M.H.: Interior methods for nonlinear optimization. SIAM Rev. 44(4), 525\u2013597 (2002)","journal-title":"SIAM Rev."},{"issue":"1","key":"1071_CR20","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s12532-012-0035-2","volume":"4","author":"MP Friedlander","year":"2012","unstructured":"Friedlander, M.P., Orban, D.: A primal-dual regularized interior-point method for convex quadratic programs. Math. Program. Comput. 4(1), 71\u2013107 (2012)","journal-title":"Math. Program. Comput."},{"key":"1071_CR21","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, P.L.: Trust-Region Methods. MPS\/SIAM Series on Optimization. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (2000)"},{"issue":"1","key":"1071_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10589-007-9095-z","volume":"41","author":"P Armand","year":"2008","unstructured":"Armand, P., Benoist, J., Orban, D.: Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming. Comput. Optim. Appl. 41(1), 1\u201325 (2008)","journal-title":"Comput. Optim. Appl."},{"issue":"2, Ser. A","key":"1071_CR23","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s10107-003-0477-4","volume":"100","author":"M Ulbrich","year":"2004","unstructured":"Ulbrich, M., Ulbrich, S., Vicente, L.N.: A globally convergent primal-dual interior-point filter method for nonlinear programming. Math. Program. 100(2, Ser. A), 379\u2013410 (2004)","journal-title":"Math. Program."},{"issue":"1","key":"1071_CR24","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.T.: Line search filter methods for nonlinear programming: local convergence. SIAM J. Optim. 16(1), 32\u201348 (2005)","journal-title":"SIAM J. Optim."},{"key":"1071_CR25","doi-asserted-by":"crossref","unstructured":"Hock, W., Schittkowski, K.: Test Examples for Nonlinear Programming Codes. Lecture Notes in Economics and Mathematical Systems, vol. 187. Springer, Berlin (1981)","DOI":"10.1007\/978-3-642-48320-2"},{"key":"1071_CR26","volume-title":"More Test Examples for Nonlinear Programming Codes","year":"1987","unstructured":"Schittkowski, K. (ed.): More Test Examples for Nonlinear Programming Codes. Springer, New York (1987)"},{"issue":"2, Ser. A","key":"1071_CR27","doi-asserted-by":"crossref","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(2, Ser. A), 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"1071_CR28","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1145\/992200.992202","volume":"30","author":"IS Duff","year":"2004","unstructured":"Duff, I.S.: Ma57\u2014a code for the solution of sparse symmetric definite and indefinite systems. ACM Trans. Math. Softw. 30, 118\u2013144 (2004)","journal-title":"ACM Trans. Math. Softw."},{"key":"1071_CR29","volume-title":"AMPL: A Modeling Language for Mathematical Programming","author":"R Fourer","year":"2002","unstructured":"Fourer, R., Gay, D.M., Kernighan, B.W.: AMPL: A Modeling Language for Mathematical Programming, 2nd edn. Brooks\/Cole, Pacific Grove (2002)","edition":"2"},{"issue":"3","key":"1071_CR30","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/030601235","volume":"15","author":"SJ Wright","year":"2005","unstructured":"Wright, S.J.: An algorithm for degenerate nonlinear programming with rapid local convergence. SIAM J. Optim. 15(3), 673\u2013696 (2005)","journal-title":"SIAM J. Optim."},{"key":"1071_CR31","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: CUTEr and SifDec: A constrained and unconstrained testing environment, revisited. Tech. rep, CERFACS, Toulouse, France (2001)"},{"key":"1071_CR32","doi-asserted-by":"crossref","unstructured":"Dolan, E.D., Mor\u00e9, J.J., Munson, T.S.: Benchmarking optimization software with COPS 3.0. Tech. rep., Argonne National Laboratory (2004)","DOI":"10.2172\/834714"},{"key":"1071_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-016-0561-1","author":"P Armand","year":"2016","unstructured":"Armand, P., Lankoand\u00e9, I.: An inexact proximal regularization method for unconstrained optimization. Math. Methods Oper. Res. (2016). doi: 10.1007\/s00186-016-0561-1","journal-title":"Math. Methods Oper. Res."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-017-1071-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-017-1071-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-017-1071-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T05:31:47Z","timestamp":1498368707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-017-1071-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,1]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["1071"],"URL":"https:\/\/doi.org\/10.1007\/s10957-017-1071-x","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,1]]}}}