{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T11:11:27Z","timestamp":1762081887230,"version":"build-2065373602"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T00:00:00Z","timestamp":1673222400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T00:00:00Z","timestamp":1673222400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s11590-022-01952-z","type":"journal-article","created":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T11:03:39Z","timestamp":1673262219000},"page":"1613-1631","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Log-domain interior-point methods for convex quadratic programming"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8935-7449","authenticated-orcid":false,"given":"Frank","family":"Permenter","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,9]]},"reference":[{"key":"1952_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1590\/S0101-82052006000100005","volume":"25","author":"M Achache","year":"2006","unstructured":"Achache, M.: A new primal-dual path-following method for convex quadratic programming. Comput. Appl. Math. 25, 97\u2013110 (2006)","journal-title":"Comput. Appl. Math."},{"issue":"2","key":"1952_CR2","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10107-002-0349-3","volume":"95","author":"ED Andersen","year":"2003","unstructured":"Andersen, E.D., Roos, C., Terlaky, T.: On implementing a primal-dual interior-point method for conic quadratic optimization. Math. Program. 95(2), 249\u2013277 (2003)","journal-title":"Math. Program."},{"issue":"1","key":"1952_CR3","doi-asserted-by":"publisher","first-page":"121","DOI":"10.4086\/toc.2012.v008a006","volume":"8","author":"S Arora","year":"2012","unstructured":"Arora, S., Hazan, E., Kale, S.: The multiplicative weights update method: a meta-algorithm and applications. Theory Compt. 8(1), 121\u2013164 (2012)","journal-title":"Theory Compt."},{"key":"1952_CR4","doi-asserted-by":"crossref","unstructured":"Di\u00a0Cairano, S., Brand, M.: On a multiplicative update dual optimization algorithm for constrained linear mpc. In 52nd IEEE Conference on Decision and Control, 1696\u20131701. IEEE (2013)","DOI":"10.1109\/CDC.2013.6760126"},{"issue":"2","key":"1952_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1090\/qam\/112751","volume":"18","author":"WS Dorn","year":"1960","unstructured":"Dorn, W.S.: Duality in quadratic programming. Q. Appl Math. 18(2), 155\u2013162 (1960)","journal-title":"Q. Appl Math."},{"issue":"1","key":"1952_CR6","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF01588795","volume":"49","author":"D Goldfarb","year":"1990","unstructured":"Goldfarb, D., Liu, S.: An $$\\cal{O} (n^3 L)$$ primal interior point algorithm for convex quadratic programming. Math. Program 49(1), 325\u2013340 (1990)","journal-title":"Math. Prog."},{"issue":"1","key":"1952_CR7","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF01582145","volume":"61","author":"D Goldfarb","year":"1993","unstructured":"Goldfarb, D., Liu, S.: An $$\\cal{O} (n^3 L)$$ primal-dual potential reduction algorithm for solving convex quadratic programs. Math. Program 61(1), 161\u2013170 (1993)","journal-title":"Math. Program."},{"issue":"3","key":"1952_CR8","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1051\/ro:2000117","volume":"34","author":"L. Gra\u00f1a Drummond","year":"2000","unstructured":"Drummond, L. Gra\u00f1a., Iusem, A.N., Svaiter, B.F.: On the central path for nonlinear semidefinite programming. RAIRO-Operat. Res.-Recherche Op\u00e9rationnelle 34(3), 331\u2013345 (2000)","journal-title":"RAIRO-Operat. Res.-Recherche Op\u00e9rationnelle"},{"key":"1952_CR9","doi-asserted-by":"crossref","unstructured":"Kapoor, S., Vaidya, P.\u00a0M.: Fast algorithms for convex quadratic programming and multicommodity flows. In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pp147\u2013159, (1986)","DOI":"10.1145\/12130.12145"},{"key":"1952_CR10","doi-asserted-by":"crossref","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. In Proceedings of the sixteenth annual ACM symposium on Theory of computing, pp 302\u2013311, (1984)","DOI":"10.1145\/800057.808695"},{"issue":"1","key":"1952_CR11","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01594942","volume":"50","author":"M Kojima","year":"1991","unstructured":"Kojima, M., Mizuno, S., Yoshise, A.: An $$O (\\sqrt{n} L)$$ iteration potential reduction algorithm for linear complementarity problems. Math. Program 50(1), 331\u2013342 (1991)","journal-title":"Math. Program."},{"issue":"1","key":"1952_CR12","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF01587076","volume":"44","author":"RD Monteiro","year":"1989","unstructured":"Monteiro, R.D., Adler, I.: Interior path following primal-dual algorithms Part II: Convex quadratic programming. Math. Program 44(1), 43\u201366 (1989)","journal-title":"Math. Program."},{"key":"1952_CR13","unstructured":"Mosek, A.P.S.: The MOSEK optimization software. Online at http:\/\/www.mosek.com"},{"key":"1952_CR14","doi-asserted-by":"crossref","unstructured":"Nesterov, Y., Nemirovskii, A., Ye, Y.: Interior-point polynomial algorithms in convex programming, vol 13. SIAM, (1994)","DOI":"10.1137\/1.9781611970791"},{"key":"1952_CR15","unstructured":"Optimization, G.: Gurobi optimizer reference manual. Online at http:\/\/www.gurobi.com"},{"key":"1952_CR16","unstructured":"Permenter, F.: A geodesic interior-point method for linear optimization over symmetric cones (2020). https:\/\/arxiv.org\/abs\/2008.08047"},{"issue":"8","key":"1952_CR17","doi-asserted-by":"publisher","first-page":"2004","DOI":"10.1162\/neco.2007.19.8.2004","volume":"19","author":"F Sha","year":"2007","unstructured":"Sha, F., Lin, Y., Saul, L.K., Lee, D.D.: Multiplicative updates for nonnegative quadratic programming. Neural Comput. 19(8), 2004\u20132031 (2007)","journal-title":"Neural Comput."},{"key":"1952_CR18","unstructured":"Terlaky, T.: Interior point methods of mathematical programming, vol\u00a05. Springer Science & Business Media, (2013)"},{"key":"1952_CR19","doi-asserted-by":"crossref","unstructured":"Wright, S.\u00a0J.: Primal-dual interior-point methods. SIAM, (1997)","DOI":"10.1137\/1.9781611971453"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01952-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01952-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01952-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T13:25:43Z","timestamp":1689168343000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01952-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,9]]},"references-count":19,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["1952"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01952-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2023,1,9]]},"assertion":[{"value":"22 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}