{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:56:49Z","timestamp":1781031409791,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":70,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800790","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"755-766","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Trust Region Interior Point Methods: Optimal \u2113\u2082- and Faster Wide-Neighborhood Path Following"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5577-5012","authenticated-orcid":false,"given":"Daniel","family":"Dadush","sequence":"first","affiliation":[{"name":"Centrum Wiskunde & Informatica, Amsterdam, Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-1854-9496","authenticated-orcid":false,"given":"Haoyuan","family":"Ma","sequence":"additional","affiliation":[{"name":"University of Bonn, Bonn, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8068-3280","authenticated-orcid":false,"given":"Bento","family":"Natura","sequence":"additional","affiliation":[{"name":"Columbia University, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1152-200X","authenticated-orcid":false,"given":"L\u00e1szl\u00f3 A.","family":"V\u00e9gh","sequence":"additional","affiliation":[{"name":"University of Bonn, Bonn, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1360\/02ys0141"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/040604492"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1142132"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00032"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3519997"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.4171\/jems\/789"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-022-09577-5"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054194000165"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3424305"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-007-9106-0"},{"key":"e_1_3_2_1_11_1","volume-title":"Nicholas IM Gould, and Philippe L Toint","author":"Conn Andrew R","year":"2000","unstructured":"Andrew R Conn, Nicholas IM Gould, and Philippe L Toint. 2000. Trust region methods. SIAM."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Daniel Dadush Sophie Huiberts Bento Natura and L\u00e1szl\u00f3 A V\u00e9gh. 2023. A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. Mathematical Programming 1\u201372.","DOI":"10.1007\/s10107-023-01956-2"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649764"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"James W Demmel. 1997. Applied numerical linear algebra. SIAM.","DOI":"10.1137\/1.9781611971446"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1080\/10556780500407725"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/3112663.3112967"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585191"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3717823.3718179"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Farbod Ekbatani Bento Natura and L\u00e1szl\u00f3 A V\u00e9gh. 2022. Circuit imbalance measures and linear programming. Surveys in combinatorics 64\u2013114.","DOI":"10.1017\/9781009093927.004"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375567"},{"key":"e_1_3_2_1_21_1","volume-title":"Multiple centrality corrections in a primal-dual method for linear programming. Computational optimization and applications, 6, 2","author":"Gondzio Jacek","year":"1996","unstructured":"Jacek Gondzio. 1996. Multiple centrality corrections in a primal-dual method for linear programming. Computational optimization and applications, 6, 2 (1996), 137\u2013156."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.09.017"},{"key":"e_1_3_2_1_23_1","series-title":"SIAM review, 34, 2","volume-title":"Path-following methods for linear programming","author":"Gonzaga Clovis C","year":"1992","unstructured":"Clovis C Gonzaga. 1992. Path-following methods for linear programming. SIAM review, 34, 2 (1992), 167\u2013224."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS61266.2024.00125"},{"key":"e_1_3_2_1_25_1","volume-title":"Instance-Optimal. In 2025 Symposium on Simplicity in Algorithms (SOSA). 202\u2013215","author":"Haeupler Bernhard","year":"2025","unstructured":"Bernhard Haeupler, Richard Hlad\u00edk, V\u00e1clav Rozho\u0148, Robert E Tarjan, and Jakub T\u011btek. 2025. Bidirectional Dijkstra\u2019s Algorithm is Instance-Optimal. In 2025 Symposium on Simplicity in Algorithms (SOSA). 202\u2013215."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Trevor Hastie Robert Tibshirani and Jerome Friedman. 2009. The elements of statistical learning: data mining inference and prediction.","DOI":"10.1007\/978-0-387-84858-7"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623494266869"},{"key":"e_1_3_2_1_28_1","first-page":"38","article-title":"Extending Mehrotra\u2019s corrector for linear programs","volume":"1","author":"Jarre Florian","year":"1999","unstructured":"Florian Jarre and Martin Wechs. 1999. Extending Mehrotra\u2019s corrector for linear programs. Advanced Modeling and Optimization, 1, 2 (1999), 38\u201360.","journal-title":"Advanced Modeling and Optimization"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451058"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808695"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/3113604.3113813"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9617-8_2"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/070693461"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.52"},{"key":"e_1_3_2_1_35_1","unstructured":"Yin Tat Lee and Aaron Sidford. 2019. Solving linear programs with sqrt (rank) linear system solves. arXiv preprint arXiv:1910.08033."},{"key":"e_1_3_2_1_36_1","unstructured":"Yin Tat Lee and Santosh S Vempala. 2021. Tutorial on the robust interior point method. arXiv preprint arXiv:2108.04734."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.83"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.35"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9617-8_8"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580074"},{"key":"e_1_3_2_1_41_1","series-title":"SIAM Journal on optimization, 2, 4","volume-title":"On the implementation of a primal-dual interior point method","author":"Mehrotra Sanjay","year":"1992","unstructured":"Sanjay Mehrotra. 1992. On the implementation of a primal-dual interior point method. SIAM Journal on optimization, 2, 4 (1992), 575\u2013601."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623403431494"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/2789755.2789767"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623401388926"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0141-5"},{"key":"e_1_3_2_1_46_1","series-title":"SIAM Journal on scientific and statistical computing, 4, 3","volume-title":"Computing a trust region step","author":"Mor\u00e9 Jorge J","year":"1983","unstructured":"Jorge J Mor\u00e9 and Danny C Sorensen. 1983. Computing a trust region step. SIAM Journal on scientific and statistical computing, 4, 3 (1983), 553\u2013572."},{"key":"e_1_3_2_1_47_1","unstructured":"MOSEK. 2025. MOSEK Optimization Toolbox for MATLAB. https:\/\/docs.mosek.com\/latest\/toolbox.pdf. Release 11.0.13"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Yurii Nesterov and Arkadii Nemirovskii. 1994. Interior-point polynomial algorithms in convex programming. SIAM.","DOI":"10.1137\/1.9781611970791"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301389"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1137\/040603991"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.5555\/3113606.3113871"},{"key":"e_1_3_2_1_52_1","first-page":"1","article-title":"A polynomial-time algorithm, based on Newton\u2019s method, for linear programming","volume":"40","author":"Renegar James","year":"1988","unstructured":"James Renegar. 1988. A polynomial-time algorithm, based on Newton\u2019s method, for linear programming. Mathematical Programming, 40, 1-3 (1988), 59\u201393.","journal-title":"Mathematical Programming"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"crossref","unstructured":"James Renegar. 2001. A mathematical view of interior-point methods in convex optimization. SIAM.","DOI":"10.1137\/1.9780898718812"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781108637435"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"crossref","unstructured":"Steve Smale. 1986. Newton\u2019s method estimates from data at one point. In The merging of disciplines: New directions in pure applied and computational mathematics. 185\u2013196.","DOI":"10.1007\/978-1-4612-4984-9_13"},{"key":"e_1_3_2_1_56_1","first-page":"19","article-title":"On the complexity of following the central path of linear programs by linear extrapolation","volume":"63","author":"Sonnevend Gy","year":"1989","unstructured":"Gy Sonnevend, J Stoer, and G Zhao. 1989. On the complexity of following the central path of linear programs by linear extrapolation. Methods of Operations Research, 63 (1989), 19\u201331.","journal-title":"Methods of Operations Research"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-020-00200-8"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"crossref","unstructured":"\u00c9va Tardos. 1986. A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research 250\u2013256.","DOI":"10.1287\/opre.34.2.250"},{"key":"e_1_3_2_1_59_1","volume-title":"Numerical Analysis","author":"Todd Michael J","year":"1993","unstructured":"Michael J Todd. 1993. A lower bound on the number of iterations of an interior-point algorithm for linear programming. In Numerical Analysis 1993. CRC Press, 237\u2013259."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02206818"},{"key":"e_1_3_2_1_61_1","volume-title":"A new algorithm for minimizing convex functions over convex sets. Mathematical programming, 73, 3","author":"Vaidya Pravin M","year":"1996","unstructured":"Pravin M Vaidya. 1996. A new algorithm for minimizing convex functions over convex sets. Mathematical programming, 73, 3 (1996), 291\u2013341."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.16"},{"key":"e_1_3_2_1_63_1","volume-title":"Unifying Matrix Data Structures: Simplifying and Speeding up Iterative Algorithms","author":"van den Brand Jan","year":"1976","unstructured":"Jan van den Brand. 2021. Unifying Matrix Data Structures: Simplifying and Speeding up Iterative Algorithms. Society for Industrial and Applied Mathematics, 1\u201313. isbn:9781611976496"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.5555\/3114198.3114682"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/3717823.3718255"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(68)90017-7"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.134"},{"key":"e_1_3_2_1_68_1","volume-title":"Recent Advances in Global Optimization","author":"Yinyu Ye.","unstructured":"Yinyu Ye. 1992. A new complexity result on minimization of a quadratic function with a sphere constraint. In Recent Advances in Global Optimization. Princeton University Press, 19\u201331."},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1137\/0806005"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01182599"}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800790","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:57:15Z","timestamp":1781027835000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800790"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":70,"alternative-id":["10.1145\/3798129.3800790","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800790","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}