No self-concordant barrier interior point method is strongly polynomial

DOI10.1145/3519935.3519997arXiv2201.02186MaRDI QIDQ6083505

Xavier Allamigeon, Stéphane Gaubert, Unnamed Author

Publication date: 8 December 2023

Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.02186

zbMATH Keywords

linear programmingconvex programminginterior point methodsself-concordant barrierstropical geometry

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: No self-concordant barrier interior point method is strongly polynomial