{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T17:04:58Z","timestamp":1749488698623,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,2,11]],"date-time":"2021-02-11T00:00:00Z","timestamp":1613001600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,11]],"date-time":"2021-02-11T00:00:00Z","timestamp":1613001600000},"content-version":"vor","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":[[2021,4]]},"DOI":"10.1007\/s10957-021-01822-1","type":"journal-article","created":{"date-parts":[[2021,2,11]],"date-time":"2021-02-11T18:10:57Z","timestamp":1613067057000},"page":"96-116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Local Convergence Analysis of a Primal\u2013Dual Method for Bound-Constrained Optimization Without SOSC"],"prefix":"10.1007","volume":"189","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":"Ngoc Nguyen","family":"Tran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,11]]},"reference":[{"issue":"2, Ser. A","key":"1822_CR1","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10107-007-0136-2","volume":"115","author":"P Armand","year":"2008","unstructured":"Armand, P., Benoist, J.: A local convergence property of primal\u2013dual methods for nonlinear programming. Math. Program. 115(2, Ser. A), 199\u2013222 (2008). https:\/\/doi.org\/10.1007\/s10107-007-0136-2","journal-title":"Math. Program."},{"issue":"1","key":"1822_CR2","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10589-011-9406-2","volume":"52","author":"P Armand","year":"2012","unstructured":"Armand, P., Benoist, J., Dussault, J.P.: Local path-following property of inexact interior methods in nonlinear programming. Comput. Optim. Appl. 52(1), 209\u2013238 (2012). https:\/\/doi.org\/10.1007\/s10589-011-9406-2","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1822_CR3","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/s10589-007-9095-z","journal-title":"Comput. Optim. Appl."},{"key":"1822_CR4","unstructured":"Byrd, R.H., Liu, G., Nocedal, J.: On the local behaviour of an interior point method for nonlinear programming. In: Numerical Analysis 1997 (Dundee), Pitman Research Notes in Mathematical Series, vol. 380, pp. 37\u201356. Longman, Harlow (1998)"},{"issue":"3","key":"1822_CR5","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). https:\/\/doi.org\/10.1007\/BF02275347","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"1822_CR6","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1137\/S1052623400370515","volume":"11","author":"NIM Gould","year":"2001","unstructured":"Gould, N.I.M., Orban, D., Sartenaer, A., Toint, P.L.: Superlinear convergence of primal\u2013dual interior point algorithms for nonlinear programming. SIAM J. Optim. 11(4), 974\u20131002 (2001). https:\/\/doi.org\/10.1137\/S1052623400370515","journal-title":"SIAM J. Optim."},{"issue":"3, Ser. B","key":"1822_CR7","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s101070100287","volume":"92","author":"NIM Gould","year":"2002","unstructured":"Gould, N.I.M., Orban, D., Sartenaer, A., Toint, P.L.: Componentwise fast convergence in the solution of full-rank systems of nonlinear equations. Math. Program. 92(3, Ser. B), 481\u2013508 (2002). https:\/\/doi.org\/10.1007\/s101070100287","journal-title":"Math. Program."},{"issue":"1","key":"1822_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1137\/S1052623401392123","volume":"14","author":"AL Tits","year":"2003","unstructured":"Tits, A.L., W\u00e4chter, A., Bakhtiari, S., Urban, T.J., Lawrence, C.T.: A primal\u2013dual interior-point method for nonlinear programming with strong global and local convergence properties. SIAM J. Optim. 14(1), 173\u2013199 (2003). https:\/\/doi.org\/10.1137\/S1052623401392123","journal-title":"SIAM J. Optim."},{"issue":"3, Ser. A","key":"1822_CR9","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/BF02592190","volume":"75","author":"H Yamashita","year":"1996","unstructured":"Yamashita, H., Yabe, H.: Superlinear and quadratic convergence of some primal\u2013dual interior point methods for constrained optimization. Math. Program. 75(3, Ser. A), 377\u2013397 (1996). https:\/\/doi.org\/10.1007\/BF02592190","journal-title":"Math. Program."},{"issue":"2","key":"1822_CR10","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10589-007-9067-3","volume":"39","author":"WW Hager","year":"2008","unstructured":"Hager, W.W., Zhang, H.: Self-adaptive inexact proximal point methods. Comput. Optim. Appl. 39(2), 161\u2013181 (2008). https:\/\/doi.org\/10.1007\/s10589-007-9067-3","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1822_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s00186-015-0522-0","volume":"83","author":"H Esmaeili","year":"2016","unstructured":"Esmaeili, H., Kimiaei, M.: A trust-region method with improved adaptive radius for systems of nonlinear equations. Math. Methods Oper. Res. 83(1), 109\u2013125 (2016). https:\/\/doi.org\/10.1007\/s00186-015-0522-0","journal-title":"Math. Methods Oper. Res."},{"issue":"1","key":"1822_CR12","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1080\/10556788.2012.746344","volume":"29","author":"J Fan","year":"2014","unstructured":"Fan, J., Yuan, Y.: A regularized Newton method for monotone nonlinear equations and its application. Optim. Methods Softw. 29(1), 102\u2013119 (2014). https:\/\/doi.org\/10.1080\/10556788.2012.746344","journal-title":"Optim. Methods Softw."},{"key":"1822_CR13","doi-asserted-by":"crossref","unstructured":"Yamashita, N., Fukushima, M.: On the rate of convergence of the Levenberg\u2013Marquardt method. In: Topics in Numerical Analysis, Computing Supplementa, vol.\u00a015, pp. 239\u2013249. Springer, Vienna (2001). https:\/\/doi.org\/10.1007\/978-3-7091-6217-0_18","DOI":"10.1007\/978-3-7091-6217-0_18"},{"issue":"1","key":"1822_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00186-016-0561-1","volume":"85","author":"P Armand","year":"2017","unstructured":"Armand, P., Lankoand\u00e9, I.: An inexact proximal regularization method for unconstrained optimization. Math. Methods Oper. Res. 85(1), 43\u201359 (2017). https:\/\/doi.org\/10.1007\/s00186-016-0561-1","journal-title":"Math. Methods Oper. Res."},{"issue":"2","key":"1822_CR15","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1023\/B:COAP.0000026881.96694.32","volume":"28","author":"DH Li","year":"2004","unstructured":"Li, D.H., Fukushima, M., Qi, L., Yamashita, N.: Regularized Newton methods for convex minimization problems with singular solutions. Comput. Optim. Appl. 28(2), 131\u2013147 (2004). https:\/\/doi.org\/10.1023\/B:COAP.0000026881.96694.32","journal-title":"Comput. Optim. Appl."},{"issue":"1\u20132","key":"1822_CR16","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10589-014-9656-x","volume":"59","author":"K Ueda","year":"2014","unstructured":"Ueda, K., Yamashita, N.: A regularized Newton method without line search for unconstrained optimization. Comput. Optim. Appl. 59(1\u20132), 321\u2013351 (2014). https:\/\/doi.org\/10.1007\/s10589-014-9656-x","journal-title":"Comput. Optim. Appl."},{"issue":"1\u20134","key":"1822_CR17","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1080\/10556789908805754","volume":"11\/12","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\/12(1\u20134), 275\u2013302 (1999). https:\/\/doi.org\/10.1080\/10556789908805754","journal-title":"Optim. Methods Softw."},{"issue":"2, Ser. A","key":"1822_CR18","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s10107-010-0341-2","volume":"130","author":"J Castro","year":"2011","unstructured":"Castro, J., Cuesta, J.: Quadratic regularizations in an interior-point method for primal block-angular problems. Math. Program. 130(2, Ser. A), 415\u2013445 (2011). https:\/\/doi.org\/10.1007\/s10107-010-0341-2","journal-title":"Math. Program."},{"issue":"1","key":"1822_CR19","doi-asserted-by":"publisher","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\u2013dual regularized interior-point method for convex quadratic programs. Math. Program. Comput. 4(1), 71\u2013107 (2012). https:\/\/doi.org\/10.1007\/s12532-012-0035-2","journal-title":"Math. Program. Comput."},{"issue":"3","key":"1822_CR20","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1007\/s10957-013-0409-2","volume":"160","author":"P Tseng","year":"2014","unstructured":"Tseng, P., Yun, S.: Incrementally updated gradient methods for constrained and regularized optimization. J. Optim. Theory Appl. 160(3), 832\u2013853 (2014). https:\/\/doi.org\/10.1007\/s10957-013-0409-2","journal-title":"J. Optim. Theory Appl."},{"issue":"1\u20132, Ser. A","key":"1822_CR21","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/s10107-011-0498-3","journal-title":"Math. Program."},{"key":"1822_CR22","unstructured":"Tran, N.N.: Infeasibility detection and regularization strategies in nonlinear optimization. Ph.D. thesis, Universit\u00e9 de Limoges, \u00c9cole Doctorale SISMI (2018). https:\/\/www.theses.fr\/2018LIMO0059"},{"issue":"3","key":"1822_CR23","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1007\/s10589-012-9461-3","volume":"53","author":"M Fuentes","year":"2012","unstructured":"Fuentes, M., Malick, J., Lemar\u00e9chal, C.: Descentwise inexact proximal algorithms for smooth optimization. Comput. Optim. Appl. 53(3), 755\u2013769 (2012). https:\/\/doi.org\/10.1007\/s10589-012-9461-3","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1822_CR24","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s11081-005-6798-9","volume":"6","author":"C Humes Jr","year":"2005","unstructured":"Humes Jr., C., Silva, P.J.S.: Inexact proximal point algorithms and descent methods in optimization. Optim. Eng. 6(2), 257\u2013271 (2005). https:\/\/doi.org\/10.1007\/s11081-005-6798-9","journal-title":"Optim. Eng."},{"issue":"1","key":"1822_CR25","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10589-007-9128-7","volume":"43","author":"YJ Li","year":"2009","unstructured":"Li, Y.J., Li, D.H.: Truncated regularized Newton method for convex minimizations. Comput. Optim. Appl. 43(1), 119\u2013131 (2009). https:\/\/doi.org\/10.1007\/s10589-007-9128-7","journal-title":"Comput. Optim. Appl."},{"issue":"1, Ser. B","key":"1822_CR26","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-007-0143-3","volume":"120","author":"RA Polyak","year":"2009","unstructured":"Polyak, R.A.: Regularized Newton method for unconstrained convex optimization. Math. Program. 120(1, Ser. B), 125\u2013145 (2009). https:\/\/doi.org\/10.1007\/s10107-007-0143-3","journal-title":"Math. Program."},{"key":"1822_CR27","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.cam.2014.03.023","volume":"269","author":"SA Santos","year":"2014","unstructured":"Santos, S.A., Silva, R.C.M.: An inexact and nonmonotone proximal method for smooth unconstrained minimization. J. Comput. Appl. Math. 269, 86\u2013100 (2014). https:\/\/doi.org\/10.1016\/j.cam.2014.03.023","journal-title":"J. Comput. Appl. Math."},{"issue":"8","key":"1822_CR28","doi-asserted-by":"publisher","first-page":"1913","DOI":"10.1007\/s11590-011-0386-z","volume":"6","author":"C Shen","year":"2012","unstructured":"Shen, C., Chen, X., Liang, Y.: A regularized Newton method for degenerate unconstrained optimization problems. Optim. Lett. 6(8), 1913\u20131933 (2012). https:\/\/doi.org\/10.1007\/s11590-011-0386-z","journal-title":"Optim. Lett."},{"issue":"1","key":"1822_CR29","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00245-009-9094-9","volume":"62","author":"K Ueda","year":"2010","unstructured":"Ueda, K., Yamashita, N.: Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization. Appl. Math. Optim. 62(1), 27\u201346 (2010). https:\/\/doi.org\/10.1007\/s00245-009-9094-9","journal-title":"Appl. Math. Optim."},{"issue":"3","key":"1822_CR30","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 127\u2013239 (2014). https:\/\/doi.org\/10.1561\/2400000003","journal-title":"Found. Trends Optim."},{"issue":"3","key":"1822_CR31","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s00245-007-9023-8","volume":"57","author":"CY Wang","year":"2008","unstructured":"Wang, C.Y., Zhang, J.Z., Zhao, W.L.: Two error bounds for constrained optimization problems and their applications. Appl. Math. Optim. 57(3), 307\u2013328 (2008). https:\/\/doi.org\/10.1007\/s00245-007-9023-8","journal-title":"Appl. Math. Optim."},{"key":"1822_CR32","doi-asserted-by":"crossref","unstructured":"Tseng, P.: Error bounds and superlinear convergence analysis of some Newton-type methods in optimization. In: Nonlinear Optimization and Related Topics (Erice, 1998), Applied Optimization, vol.\u00a036, pp. 445\u2013462. Kluwer Academic Publishers, Dordrecht (2000). https:\/\/doi.org\/10.1007\/978-1-4757-3226-9_24","DOI":"10.1007\/978-1-4757-3226-9_24"},{"key":"1822_CR33","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"RA Horn","year":"2013","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis, 2nd edn. Cambridge University Press, Cambridge (2013). https:\/\/doi.org\/10.1017\/CBO9780511810817","edition":"2"},{"issue":"5","key":"1822_CR34","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1080\/10556788.2012.668905","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"1822_CR35","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s10957-017-1071-x","volume":"173","author":"P Armand","year":"2017","unstructured":"Armand, P., Omheni, R.: A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization. J. Optim. Theory Appl. 173(2), 523\u2013547 (2017). https:\/\/doi.org\/10.1007\/s10957-017-1071-x","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1822_CR36","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). https:\/\/doi.org\/10.1137\/S1052623403426556","journal-title":"SIAM J. Optim."},{"key":"1822_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-48320-2","volume-title":"Test Examples for Nonlinear Programming Codes. Lecture Notes in Economics and Mathematical Systems","author":"W Hock","year":"1981","unstructured":"Hock, W., Schittkowski, K.: Test Examples for Nonlinear Programming Codes. Lecture Notes in Economics and Mathematical Systems, vol. 187. Springer, Berlin, New York (1981)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-021-01822-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-021-01822-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-021-01822-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,31]],"date-time":"2021-03-31T20:14:15Z","timestamp":1617221655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-021-01822-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,11]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["1822"],"URL":"https:\/\/doi.org\/10.1007\/s10957-021-01822-1","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2021,2,11]]},"assertion":[{"value":"9 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}