{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:25:31Z","timestamp":1740122731439,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,9,28]],"date-time":"2024-09-28T00:00:00Z","timestamp":1727481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,28]],"date-time":"2024-09-28T00:00:00Z","timestamp":1727481600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100015599","name":"Toyota Research Institute","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100015599","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10589-024-00610-7","type":"journal-article","created":{"date-parts":[[2024,9,28]],"date-time":"2024-09-28T13:02:22Z","timestamp":1727528542000},"page":"625-658","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Inexact log-domain interior-point methods for quadratic programming"],"prefix":"10.1007","volume":"89","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7729-5861","authenticated-orcid":false,"given":"Jordan","family":"Leung","sequence":"first","affiliation":[]},{"given":"Frank","family":"Permenter","sequence":"additional","affiliation":[]},{"given":"Ilya","family":"Kolmanovsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,28]]},"reference":[{"key":"610_CR1","doi-asserted-by":"crossref","unstructured":"Wright, S.J.: Primal-dual Interior-point Methods. Society for Industrial and Applied Mathematics, Philadelphia, PA (1997)","DOI":"10.1137\/1.9781611971453"},{"key":"610_CR2","unstructured":"MOSEK ApS: The MOSEK optimization software. https:\/\/www.mosek.com"},{"key":"610_CR3","unstructured":"Gurobi Optimization, LLC: Gurobi optimization software. https:\/\/www.gurobi.com"},{"issue":"1","key":"610_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0377-0427(00)00433-7","volume":"124","author":"FA Potra","year":"2000","unstructured":"Potra, F.A., Wright, S.J.: Interior-point methods. J. Comput. Appl. Math. 124(1), 281\u2013302 (2000). https:\/\/doi.org\/10.1016\/S0377-0427(00)00433-7","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"610_CR5","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/j.ejor.2011.09.017","volume":"218","author":"J Gondzio","year":"2012","unstructured":"Gondzio, J.: Interior point methods 25 years later. Eur. J. Oper. Res. 218(3), 587\u2013601 (2012). https:\/\/doi.org\/10.1016\/j.ejor.2011.09.017","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"610_CR6","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.: Feature article-interior point methods for linear programming: computational state of the art. ORSA J. Comput. 6(1), 1\u201314 (1994). https:\/\/doi.org\/10.1287\/ijoc.6.1.1","journal-title":"ORSA J. Comput."},{"key":"610_CR7","doi-asserted-by":"crossref","unstructured":"Anderson, E.D., Gondzio, J., M\u00e9sz\u00e1ros, C., Xu, X.: In: Terlaky, T. (ed.) Implementation of Interior-Point Methods for Large Scale Linear Programs, pp. 189\u2013252. Springer, Boston, (1996).","DOI":"10.1007\/978-1-4613-3449-1_6"},{"key":"610_CR8","doi-asserted-by":"publisher","unstructured":"Andersen, E.D., Andersen, K.D.: In: Frenk, H., Roos, K., Terlaky, T., Zhang, S. (eds.) The Mosek Interior Point Optimizer for Linear Programming: An Implementation of the Homogeneous Algorithm, pp. 197\u2013232. Springer, Boston, (2000).https:\/\/doi.org\/10.1007\/978-1-4757-3216-0_8","DOI":"10.1007\/978-1-4757-3216-0_8"},{"key":"610_CR9","unstructured":"Kelley, C.T.: Iterative methods for linear and nonlinear equations. frontiers in applied mathematics, vol. 16. SIAM, Philadelphia, PA (2006)"},{"issue":"1","key":"610_CR10","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1137\/0613022","volume":"13","author":"PE Gill","year":"1992","unstructured":"Gill, P.E., Murray, W., Poncele\u00f3n, D.B., Saunders, M.A.: Preconditioners for indefinite systems arising in optimization. SIAM J. Matrix Anal. Appl. 13(1), 292\u2013311 (1992). https:\/\/doi.org\/10.1137\/0613022","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"610_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.laa.2004.08.019","volume":"394","author":"ARL Oliveira","year":"2005","unstructured":"Oliveira, A.R.L., Sorensen, D.C.: A new class of preconditioners for large-scale linear systems from interior point methods for linear programming. Linear Algebra Appl. 394, 1\u201324 (2005). https:\/\/doi.org\/10.1016\/j.laa.2004.08.019","journal-title":"Linear Algebra Appl."},{"key":"610_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1023\/A:1022663100715","volume":"96","author":"S Bellavia","year":"1998","unstructured":"Bellavia, S.: Inexact interior-point method. J. Optim. Theory Appl. 96, 109\u2013121 (1998). https:\/\/doi.org\/10.1023\/A:1022663100715","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"610_CR13","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1137\/0719025","volume":"19","author":"RS Dembo","year":"1982","unstructured":"Dembo, R.S., Eisenstat, S.C., Steihaug, T.: Inexact Newton methods. SIAM J. Numer. Anal. 19(2), 400\u2013408 (1982). https:\/\/doi.org\/10.1137\/0719025","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"610_CR14","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1137\/0804022","volume":"4","author":"SC Eisenstat","year":"1994","unstructured":"Eisenstat, S.C., Walker, H.F.: Globally convergent inexact Newton methods. SIAM J. Optim. 4(2), 393\u2013422 (1994). https:\/\/doi.org\/10.1137\/0804022","journal-title":"SIAM J. Optim."},{"key":"610_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10107980020a","volume":"84","author":"S Mizuno","year":"1999","unstructured":"Mizuno, S., Jarre, F.: Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation. Math. Program. 84, 105\u2013122 (1999). https:\/\/doi.org\/10.1007\/s10107980020a","journal-title":"Math. Program."},{"key":"610_CR16","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10957-008-9500-5","volume":"141","author":"G Al-Jeiroudi","year":"2009","unstructured":"Al-Jeiroudi, G., Gondzio, J.: Convergence analysis of the inexact infeasible interior-point method for linear optimization. J. Optim. Theory Appl. 141, 231\u2013247 (2009). https:\/\/doi.org\/10.1007\/s10957-008-9500-5","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"610_CR17","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/120886017","volume":"23","author":"J Gondzio","year":"2013","unstructured":"Gondzio, J.: Convergence analysis of an inexact feasible interior point method for convex quadratic programming. SIAM J. Optim. 23(3), 1510\u20131527 (2013). https:\/\/doi.org\/10.1137\/120886017","journal-title":"SIAM J. Optim."},{"key":"610_CR18","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10957-007-9264-3","volume":"135","author":"S Cafieri","year":"2007","unstructured":"Cafieri, S., D\u2019Apuzzo, M., De Simone, V., Serafino, D., Toraldo, G.: Convergence analysis of an inexact potential reduction method for convex quadratic programming. J. Optim. Theory Appl. 135, 355\u2013366 (2007). https:\/\/doi.org\/10.1007\/s10957-007-9264-3","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"610_CR19","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1137\/22M1490041","volume":"45","author":"F Zanetti","year":"2023","unstructured":"Zanetti, F., Gondzio, J.: A new stopping criterion for Krylov solvers applied in interior point methods. SIAM J. Sci. Comput. 45(2), 703\u2013728 (2023). https:\/\/doi.org\/10.1137\/22M1490041","journal-title":"SIAM J. Sci. Comput."},{"key":"610_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-022-01952-z","author":"F Permenter","year":"2023","unstructured":"Permenter, F.: Log-domain interior-point methods for convex quadratic programming. Optim. Lett. (2023). https:\/\/doi.org\/10.1007\/s11590-022-01952-z","journal-title":"Optim. Lett."},{"issue":"2","key":"610_CR21","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1137\/20M1385019","volume":"33","author":"F Permenter","year":"2023","unstructured":"Permenter, F.: A geodesic interior-point method for linear optimization over symmetric cones. SIAM J. Optim. 33(2), 1006\u20131034 (2023). https:\/\/doi.org\/10.1137\/20M1385019","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"610_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/0400000060","volume":"10","author":"DP Woodruff","year":"2014","unstructured":"Woodruff, D.P.: Sketching as a tool for numerical linear algebra. Found. Trends Theor. Comput. Sci. 10(1\u20132), 1\u2013157 (2014). https:\/\/doi.org\/10.1561\/0400000060","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"610_CR23","unstructured":"Gower, R.M.: Sketch and project: randomized iterative methods for linear systems and inverting matrices. PhD thesis, The University of Edinburgh (2016)"},{"issue":"2","key":"610_CR24","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0377-0427(87)90020-3","volume":"18","author":"HA Van Der Vorst","year":"1987","unstructured":"Van Der Vorst, H.A.: An iterative solution method for solving f(a)x = b, using krylov subspace information obtained for the symmetric positive definite matrix a. J. Comput. Appl. Math. 18(2), 249\u2013263 (1987). https:\/\/doi.org\/10.1016\/0377-0427(87)90020-3","journal-title":"J. Comput. Appl. Math."},{"key":"610_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"4","key":"610_CR26","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s12532-020-00179-2","volume":"12","author":"B Stellato","year":"2020","unstructured":"Stellato, B., Banjac, G., Goulart, P., Bemporad, A., Boyd, S.: OSQP: an operator splitting solver for quadratic programs. Math. Program. Comput. 12(4), 637\u2013672 (2020). https:\/\/doi.org\/10.1007\/s12532-020-00179-2","journal-title":"Math. Program. Comput."},{"key":"610_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/9781139061759","volume-title":"Predictive Control for Linear and Hybrid Systems","author":"F Borrelli","year":"2017","unstructured":"Borrelli, F., Bemporad, A., Morari, M.: Predictive Control for Linear and Hybrid Systems. Cambridge University Press, Cambridge (2017)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00610-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-024-00610-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00610-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T13:12:52Z","timestamp":1731676372000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-024-00610-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,28]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["610"],"URL":"https:\/\/doi.org\/10.1007\/s10589-024-00610-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2024,9,28]]},"assertion":[{"value":"6 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there are no conflict of interest associated with this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}