{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:23:43Z","timestamp":1787340223916,"version":"build-2736575974"},"reference-count":27,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"DOI":"10.13039\/501100003825","name":"Magyar Tudom\u00e1nyos Akad\u00e9mia","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003825","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012550","name":"Nemzeti Kutat\u00e1si, Fejleszt\u00e9si \u00e9s Innovaci\u00f3s Alap","doi-asserted-by":"publisher","award":["2024-1.2.3-HU-RIZONT-2024-00030"],"award-info":[{"award-number":["2024-1.2.3-HU-RIZONT-2024-00030"]}],"id":[{"id":"10.13039\/501100012550","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012550","name":"Nemzeti Kutat\u00e1si, Fejleszt\u00e9si \u00e9s Innovaci\u00f3s Alap","doi-asserted-by":"publisher","award":["142154"],"award-info":[{"award-number":["142154"]}],"id":[{"id":"10.13039\/501100012550","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[2026,3,31]]},"abstract":"<jats:p>Abstract.<\/jats:p>\n                  <jats:p>In this paper, we suggest a new interior-point algorithm for linear optimization, based on the idea of parabolic target space. Our algorithm can start at any strictly feasible primal-dual pair and go directly towards a solution by a predictor-corrector scheme. We prove that the complexity of the proposed method coincides with the currently known best complexity results for interior-point algorithms. The method demonstrates a very fast local convergence on the test set problems we have evaluated. One of the main differences between our approach and the standard framework is that our algorithm is based on a parabolic primal-dual barrier function.<\/jats:p>","DOI":"10.1137\/24m1705780","type":"journal-article","created":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T09:00:23Z","timestamp":1771491623000},"page":"185-203","source":"Crossref","is-referenced-by-count":0,"title":["New Interior-Point Algorithm for Linear Optimization Based on a Universal Tangent Direction"],"prefix":"10.1137","volume":"36","author":[{"given":"Marianna","family":"Eisenberg-Nagy","sequence":"first","affiliation":[{"name":"Corvinus Centre for Operations Research, Corvinus Institute for Advanced Studies, Corvinus University of Budapest, H-1093 Budapest, Hungary."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tibor","family":"Ill\u00e9s","sequence":"additional","affiliation":[{"name":"Corvinus Centre for Operations Research, Corvinus Institute for Advanced Studies, Corvinus University of Budapest, H-1093 Budapest, Hungary."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yurii","family":"Nesterov","sequence":"additional","affiliation":[{"name":"Corvinus Centre for Operations Research, Corvinus Institute for Advanced Studies, Corvinus University of Budapest, H-1093 Budapest, Hungary."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Petra Ren\u00e1ta","family":"Rig\u00f3","sequence":"additional","affiliation":[{"name":"Corvinus Centre for Operations Research, Corvinus Institute for Advanced Studies, Corvinus University of Budapest, H-1093 Budapest, Hungary."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2026,2,19]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/040604492"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623401398132"},{"key":"ref3","first-page":"51","volume":"5","author":"Darvay Z.","year":"2003","journal-title":"Adv. Model. Optim."},{"key":"ref4","doi-asserted-by":"crossref","unstructured":"M. E.Nagy, T. Ill\u00e9s, Yu Nesterov, and P. R. Rig\u00f3, Parabolic Target Space Interior-Point Algorithms for Weighted Monotone Linear Complementarity Problem, Tech. Report 4, Corvinus Econ. Work. Paper, 2024.","DOI":"10.1007\/s10107-025-02260-x"},{"key":"ref5","unstructured":"M. E.Nagy and A. Varga, A Long-Step Interior Point Framework and a Related Function Class for Linear Optimization, Tech. Report 1, Corvinus Econ. Work. Paper, 2024."},{"key":"ref6","volume-title":"Nonlinear Programming:\u00a0Sequential Unconstrained Minimization Techniques","author":"Fiacco A.","year":"1969"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9617-8_1"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-023-02232-1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579150"},{"key":"ref10","first-page":"191","volume":"20","author":"Khachiyan L.","year":"1979","journal-title":"Soviet Math. Dokl."},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9617-8_2"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/090766735"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/0802028"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/moor.18.4.964"},{"key":"ref15","first-page":"513","volume":"38","author":"Nemirovski A.","year":"1977","journal-title":"Automat. Remote Control"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.05.002"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91578-4"},{"key":"ref19","unstructured":"Yu Nesterov, Local and Global Convergence of Greedy Parabolic Target-Following Methods for Linear Programming, Technical report, https:\/\/arxiv.org\/pdf\/2412.14934, 2024."},{"key":"ref20","volume-title":"Numerical Optimization","author":"Nocedal J.","year":"2006"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00275-8"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0068-2"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580724"},{"key":"ref24","volume-title":"Interior Point Methods for Linear Optimization","author":"Roos C.","year":"2005"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0043914"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF02614377"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008637929927"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/24M1705780","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:25:37Z","timestamp":1787336737000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/24M1705780"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,19]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3,31]]}},"alternative-id":["10.1137\/24M1705780"],"URL":"https:\/\/doi.org\/10.1137\/24m1705780","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,19]]}}}