{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:28:38Z","timestamp":1765888118860,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,2,26]],"date-time":"2019-02-26T00:00:00Z","timestamp":1551139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000848","name":"University of Edinburgh","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000848","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s10957-019-01491-1","type":"journal-article","created":{"date-parts":[[2019,2,26]],"date-time":"2019-02-26T06:18:48Z","timestamp":1551161928000},"page":"905-945","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Dynamic Non-diagonal Regularization in Interior Point Methods for Linear and Convex Quadratic Programming"],"prefix":"10.1007","volume":"181","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7903-9335","authenticated-orcid":false,"given":"Spyridon","family":"Pougkakiotis","sequence":"first","affiliation":[]},{"given":"Jacek","family":"Gondzio","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,26]]},"reference":[{"issue":"3","key":"1491_CR1","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/j.ejor.2011.09.017","volume":"218","author":"J Gondzio","year":"2013","unstructured":"Gondzio, J.: Interior point methods 25 years later. Eur. J. Oper. Res. 218(3), 587\u2013601 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"1&2","key":"1491_CR2","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. Prog. 137(1&2), 587\u2013592 (2013)","journal-title":"Math. Prog."},{"key":"1491_CR3","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. Meth. Soft. 11 & 12, 275\u2013302 (1999)","journal-title":"Optim. Meth. Soft."},{"issue":"1","key":"1491_CR4","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1137\/0805005","volume":"5","author":"R Vanderbei","year":"1995","unstructured":"Vanderbei, R.: Symmetric quasidefinite matrices. SIAM J. Optim. 5(1), 100\u2013113 (1995)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1491_CR5","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-dual regularized interior-point method for convex quadratic programs. Math. Prog. Comput. 4(1), 71\u2013107 (2012)","journal-title":"Math. Prog. Comput."},{"key":"1491_CR6","unstructured":"Saunders, M.A., Tomlin, J.A.: Solving regularized linear programs using barrier methods and KKT systems. SOL Report 96-4, Dept. of EESOR, Stanford University (1996)"},{"key":"1491_CR7","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, 523\u2013547 (2017)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1491_CR8","doi-asserted-by":"publisher","first-page":"1613","DOI":"10.1137\/16M1088570","volume":"28","author":"S Arreckx","year":"2018","unstructured":"Arreckx, S., Orban, D.: A regularized factorization-free method for equality-constrained optimization. SIAM J. Optim. 28(2), 1613\u20131639 (2018)","journal-title":"SIAM J. Optim."},{"key":"1491_CR9","volume-title":"Convex Analysis and Optimization","author":"D Bertsekas","year":"2003","unstructured":"Bertsekas, D., Nedic, A., Ozdaglar, E.: Convex Analysis and Optimization. Athena Scientific, Nashua (2003)"},{"issue":"4","key":"1491_CR10","doi-asserted-by":"publisher","first-page":"1326","DOI":"10.1137\/060675320","volume":"18","author":"M Friedlander","year":"2007","unstructured":"Friedlander, M., Tseng, P.: Exact regularization of convex programs. SIAM J. Optim. 18(4), 1326\u20131350 (2007)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1491_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 1(2), 97\u2013116 (1976)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"1491_CR12","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/BF00940051","volume":"73","author":"Y Censor","year":"1992","unstructured":"Censor, Y., Zenios, A.: Proximal minimization algorithm with D-functions. J. Optim. Theory Appl. 73(3), 451\u2013464 (1992)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1491_CR13","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/BF02193058","volume":"85","author":"AN Iusem","year":"1995","unstructured":"Iusem, A.N.: Some properties of generalized proximal point methods for quadratic and linear programming. J. Optim. Theory Appl. 85(3), 593\u2013612 (1995)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1491_CR14","first-page":"123","volume":"3","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 3(1), 123\u2013231 (2014)","journal-title":"Found. Trends Optim."},{"issue":"4","key":"1491_CR15","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1137\/0802032","volume":"2","author":"O Guler","year":"1992","unstructured":"Guler, O.: New proximal point algorithms for convex minimization. SIAM J. Optim. 2(4), 649\u2013664 (1992)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"1491_CR16","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)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"1491_CR17","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/1012015","volume":"12","author":"AC Williams","year":"1970","unstructured":"Williams, A.C.: Complementarity theorems for linear programming. SIAM Rev. 12(1), 135\u2013137 (1970)","journal-title":"SIAM Rev."},{"key":"1491_CR18","doi-asserted-by":"crossref","unstructured":"Megiddo, N.: Pathways to the optimal set in linear programming. In Progress in Mathematical Programming, pp. 131\u2013158. Springer, Berlin (1989)","DOI":"10.1007\/978-1-4613-9617-8_8"},{"issue":"1","key":"1491_CR19","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01580610","volume":"60","author":"O Guller","year":"1993","unstructured":"Guller, O., Ye, Y.: Convergence behaviour of interior point algorithms. Math. Prog. 60(1), 215\u2013228 (1993)","journal-title":"Math. Prog."},{"key":"1491_CR20","unstructured":"Haeser, G., Hinder, O., Ye, Y.: On the behaviour of lagrange multipliers in convex and non-convex ifeasible interior point methods. arXiv preprint (\n                    arXiv:1707.07327\n                    \n                  ) (2017)"},{"issue":"1","key":"1491_CR21","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.apnum.2011.09.010","volume":"62","author":"Y Nakatsukasa","year":"2012","unstructured":"Nakatsukasa, Y.: Eigenvalue perturbation bounds for Hermitian block tridiagonal matrices. Appl. Numer. Math. 62(1), 67\u201378 (2012)","journal-title":"Appl. Numer. Math."},{"key":"1491_CR22","volume-title":"Matrix Perturbation Theory","author":"GW Stewart","year":"1990","unstructured":"Stewart, G.W., Sun, J.G.: Matrix Perturbation Theory. Academic Press, London (1990)"},{"issue":"4","key":"1491_CR23","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1080\/03081087.2014.903252","volume":"63","author":"GH Cheng","year":"2015","unstructured":"Cheng, G.H., Tan, Q., Wang, Z.D.: A note on eigenvalues of perturbed 2x2 block Hermitian matrices. Linear Multilinear Algebra 63(4), 820\u2013825 (2015)","journal-title":"Linear Multilinear Algebra"},{"issue":"5","key":"1491_CR24","doi-asserted-by":"publisher","first-page":"1352","DOI":"10.1137\/0731070","volume":"31","author":"D Silvester","year":"1994","unstructured":"Silvester, D., Wathen, A.: Fast iterative solution of stabilised stokes systems part II: using general block preconditioners. SIAM J. Numer. \u2018Anal. 31(5), 1352\u20131367 (1994)","journal-title":"SIAM J. Numer. \u2018Anal."},{"issue":"3","key":"1491_CR25","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1137\/0613054","volume":"13","author":"T Rusten","year":"1992","unstructured":"Rusten, T., Winther, R.: A preconditioned iterative method for saddle-point problems. SIAM J. Matrix Anal. Appl. 13(3), 887\u2013904 (1992)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"1491_CR26","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."},{"key":"1491_CR27","unstructured":"Netlib. \n                    http:\/\/netlib.org\/lp\n                    \n                   (2011)"},{"key":"1491_CR28","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1080\/10556789908805768","volume":"11 & 12","author":"I Maros","year":"1999","unstructured":"Maros, I., M\u00e9sz\u00e1ros, C.: A repository of convex quadratic programming problems. Optim. Methods Softw. 11 & 12, 671\u2013681 (1999)","journal-title":"Optim. Methods Softw."},{"key":"1491_CR29","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"DE Dolan","year":"2002","unstructured":"Dolan, D.E., Mor, J.J.: Benchmarking optimization software with performance profiles. Math. Prog. Ser. A 91, 201\u2013213 (2002)","journal-title":"Math. Prog. Ser. A"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-019-01491-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-019-01491-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-019-01491-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,25]],"date-time":"2020-02-25T19:06:47Z","timestamp":1582657607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-019-01491-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,26]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["1491"],"URL":"https:\/\/doi.org\/10.1007\/s10957-019-01491-1","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2019,2,26]]},"assertion":[{"value":"29 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}