{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T03:44:20Z","timestamp":1768707860743,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T00:00:00Z","timestamp":1549411200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s12532-019-00154-6","type":"journal-article","created":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T18:11:49Z","timestamp":1549476709000},"page":"421-455","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Solving quadratic programs to high precision using scaled iterative refinement"],"prefix":"10.1007","volume":"11","author":[{"given":"Tobias","family":"Weber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Sager","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0391-5903","authenticated-orcid":false,"given":"Ambros","family":"Gleixner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,6]]},"reference":[{"issue":"2","key":"154_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/380995.380999","volume":"2","author":"KP Bennett","year":"2000","unstructured":"Bennett, K.P., Campbell, C.: Support vector machines: hype or hallelujah? ACM SIGKDD Explor. Newsl. 2(2), 1\u201313 (2000)","journal-title":"ACM SIGKDD Explor. Newsl."},{"key":"154_CR2","unstructured":"CPLEX, IBM ILOG: 12.7 user\u2019s manual. \n                    https:\/\/www.ibm.com\n                    \n                   (2016). Accessed 25 Oct 2019"},{"key":"154_CR3","volume-title":"Optimal Quadratic Programming Algorithms: With Applications to Variational Inequalities","author":"Z Dost\u00e1l","year":"2009","unstructured":"Dost\u00e1l, Z.: Optimal Quadratic Programming Algorithms: With Applications to Variational Inequalities, 1st edn. Springer Publishing Company, Incorporated, Berlin (2009)","edition":"1"},{"issue":"4","key":"154_CR4","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s12532-014-0071-1","volume":"6","author":"HJ Ferreau","year":"2014","unstructured":"Ferreau, H.J., Kirches, C., Potschka, A., Bock, H.G., Diehl, M.: qpOASES: a parametric active-set algorithm for quadratic programming. Math. Program. Comput. 6(4), 327\u2013363 (2014)","journal-title":"Math. Program. Comput."},{"key":"154_CR5","unstructured":"Fletcher, R., Leyffer, S.: User manual for filterSQP. Numerical Analysis Report NA\/181, Department of Mathematics, University of Dundee, Dundee, Scotland (1998)"},{"key":"154_CR6","doi-asserted-by":"crossref","unstructured":"G\u00e4rtner, B., Sch\u00f6nherr, S.: An efficient, exact, and generic quadratic programming solver for geometric optimization. In: Proceedings of the Sixteenth Annual Symposium on Computational Geometry, pp. 110\u2013118. ACM (2000)","DOI":"10.1145\/336154.336191"},{"key":"154_CR7","unstructured":"Gill, P.E., Murray, W., Saunders, M.A.: User\u2019s guide for QPOPT 1.0: A Fortran package for quadratic programming. Technical report (1995)"},{"key":"154_CR8","unstructured":"Gleixner, A.M.: Exact and fast algorithms for mixed-integer nonlinear programming. Ph.D. thesis, Technische Universit\u00e4t Berlin (2015)"},{"key":"154_CR9","doi-asserted-by":"crossref","unstructured":"Gleixner, A.M., Steffy, D.E., Wolter, K.: Improving the accuracy of linear programming solvers with iterative refinement. In: ISSAC 2012. Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, pp. 187\u2013194. ACM (2012)","DOI":"10.1145\/2442829.2442858"},{"issue":"3","key":"154_CR10","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1287\/ijoc.2016.0692","volume":"28","author":"AM Gleixner","year":"2016","unstructured":"Gleixner, A.M., Steffy, D.E., Wolter, K.: Iterative refinement for linear programming. INFORMS J. Comput. 28(3), 449\u2013464 (2016). \n                    https:\/\/doi.org\/10.1287\/ijoc.2016.0692","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"154_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/103162.103163","volume":"23","author":"D Goldberg","year":"1991","unstructured":"Goldberg, D.: What every computer scientist should know about floating-point arithmetic. ACM Comput. Surv. 23(1), 5\u201348 (1991). \n                    https:\/\/doi.org\/10.1145\/103162.103163","journal-title":"ACM Comput. Surv."},{"key":"154_CR12","doi-asserted-by":"crossref","unstructured":"Goldfarb, D., Idnani, A.: Dual and primal-dual methods for solving strictly convex quadratic programs. In: Hennart J.P. (eds.) Numerical Analysis. Lecture Notes in Mathematics, vol 909. Springer, Heidelberg (1982)","DOI":"10.1007\/BFb0092976"},{"issue":"4","key":"154_CR13","doi-asserted-by":"publisher","first-page":"1376","DOI":"10.1137\/S1064827598345667","volume":"23","author":"NI Gould","year":"2001","unstructured":"Gould, N.I., Hribar, M.E., Nocedal, J.: On the solution of equality constrained quadratic programming problems arising in optimization. SIAM J. Sci. Comput. 23(4), 1376\u20131395 (2001)","journal-title":"SIAM J. Sci. Comput."},{"key":"154_CR14","unstructured":"Granlund, T., the GMP Development Team: GNU MP. The GNU Multiple Precision Arithmetic Library. Edition 6.1.0. \n                    https:\/\/gmplib.org\/\n                    \n                  . Accessed 25 Jan 2019"},{"key":"154_CR15","unstructured":"Gurobi\u00a0Optimization, I.: Gurobi optimizer reference manual. Technical Report Version 7.5 (2017). \n                    http:\/\/www.gurobi.com\n                    \n                  . Accessed 25 Oct 2017"},{"key":"154_CR16","first-page":"85","volume-title":"Linear programming\u2013new frontiers in theory and applications","author":"M Hlad\u0131k","year":"2012","unstructured":"Hlad\u0131k, M.: Interval linear programming: a survey. In: Mann, Z.\u00c1. (ed.) Linear programming\u2013new frontiers in theory and applications, pp. 85\u2013120. Nova Science Publishers, New York (2012)"},{"key":"154_CR17","doi-asserted-by":"publisher","unstructured":"IEEE, New York, NY, USA: IEEE Std 754-2008, Standard for Floating-Point Arithmetic (2008). \n                    https:\/\/doi.org\/10.1109\/IEEESTD.2008.4610935","DOI":"10.1109\/IEEESTD.2008.4610935"},{"issue":"2","key":"154_CR18","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1137\/130940384","volume":"25","author":"TC Johnson","year":"2015","unstructured":"Johnson, T.C., Kirches, C., W\u00e4chter, A.: An active-set method for quadratic programming based on sequential hot-starts. SIAM J. Optim. 25(2), 967\u2013994 (2015)","journal-title":"SIAM J. Optim."},{"issue":"1\u20134","key":"154_CR19","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1080\/10556789908805768","volume":"11","author":"I Maros","year":"1999","unstructured":"Maros, I., M\u00e9sz\u00e1ros, C.: A repository of convex quadratic programming problems. Optim. Methods Softw. 11(1\u20134), 671\u2013681 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"154_CR20","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1137\/16M1079002","volume":"28","author":"R Quirynen","year":"2018","unstructured":"Quirynen, R., Gros, S., Diehl, M.: Inexact newton-type optimization with iterated sensitivities. SIAM J. Optim. 28(1), 74\u201395 (2018)","journal-title":"SIAM J. Optim."},{"key":"154_CR21","doi-asserted-by":"publisher","unstructured":"Weber, T., Gleixner, A.: QPRefinement (2019). \n                    https:\/\/doi.org\/10.5281\/zenodo.2532184\n                    \n                  . \n                    https:\/\/github.com\/TobiasWeber\/QPRefinement","DOI":"10.5281\/zenodo.2532184"},{"key":"154_CR22","unstructured":"Wilkinson, J.H.: Rounding errors in algebraic processes. In: IFIP Congress, pp. 44\u201353 (1959)"},{"key":"154_CR23","first-page":"382","volume":"27","author":"P Wolfe","year":"1959","unstructured":"Wolfe, P.: The simplex method for quadratic programming. Econom. J. Econom. Soc. 27, 382\u2013398 (1959)","journal-title":"Econom. J. Econom. Soc."},{"key":"154_CR24","unstructured":"Wunderling, R.: Paralleler und Objektorientierter Simplex-Algorithmus. Ph.D. thesis, Technische Universit\u00e4t Berlin (1996)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-019-00154-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-019-00154-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-019-00154-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T13:28:59Z","timestamp":1583501339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-019-00154-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,6]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["154"],"URL":"https:\/\/doi.org\/10.1007\/s12532-019-00154-6","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,6]]},"assertion":[{"value":"20 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}