Bento Natura

We prove a strongly polynomial bound on the circuit diameter of polyhedra, resolving the circuit analogue of the polynomial Hirsch conjecture. Specifically, we show that the circuit diameter of a polyhedron $P = \{x \in \mathbb{R}^n : Ax = b, x \geq 0\}$ with $A \in \mathbb{R}^{m \times n}$ is $O(m^2 \log m)$. Our construction yields monotone circuit walks, giving the same bound for the monotone circuit diameter.
The circuit diameter, introduced by Borgwardt, Finhold, and Hemmecke (SIDMA 2015), is a natural relaxation of the combinatorial diameter that allows steps along circuit directions rather than only along edges. All prior upper bounds on the circuit diameter were only weakly polynomial. Finding a circuit augmentation algorithm that matches this bound would yield a strongly polynomial time algorithm for linear programming, resolving Smale's 9th problem.

@inproceedings{natura2026circuitdiameterpolyhedrastrongly,
  author = {Natura, Bento},
  title = {Circuit Diameter of Polyhedra is Strongly Polynomial},
  year = {2026},
  eprint = {2602.06958},
  archiveprefix = {arXiv},
  primaryclass = {math.OC},
}

We present improved running time and iteration complexities of interior point methods for linear programs parametrized by the straight line complexity, i.e., the minimum number of segments of any piecewise linear curve traversing a particular neighborhood of the central path. While the standard measure of progress is the reduction in duality gap, the straight line complexity provides a stronger instance-wise bound, reflecting the combinatorial structure of the problem.
Our first main result is a wide neighborhood interior point method whose running time is the wide-neighborhood straight line complexity times current matrix multiplication time, improving in essence a factor $n$ over the algorithm by Allamigeon, Dadush, Loho, Natura, and Végh (SIAM J. Comput. 2025). The algorithm can be seen as a boosted version of the robust interior point methods of Cohen, Lee and Song (JACM 2021) and van den Brand (SODA 2020) that can reduce the gap by a polynomial factor in current matrix multiplication time. Our algorithm is also able to traverse any near-linear segments of the central path in current matrix multiplication time, independently of the length of the segment.
Our second main result focuses on interior point methods that stay in the narrow $\ell_2$-neighborhood. We give a much stronger analysis of the $\ell_2$-trust region interior point method introduced by Lan, Monteiro and Tsuchiya (SIAM J. Optim. 2009), showing that it is approximately instance optimal in this neighborhood: the number of iterations is within a constant factor of the lower bound.
A main ingredient in both methods are trust region subroutines with $\ell_\infty$ and $\ell_2$-constraints, respectively. We develop fast and strongly polynomial algorithms for solving both these problems to high accuracy. In the $\ell_2$-setting, this answers an open question by Lan, Monteiro and Tsuchiya.

@inproceedings{trust-region-ipm,
  booktitle = {Proceedings of the 58th Annual ACM SIGACT Symposium on Theory of Computing (STOC)},
  author = {Dadush, Daniel and Ma, Haoyuan and Natura, Bento and Végh, László A.},
  title = {Trust Region Interior Point Methods: Optimal $\ell_2$- and Faster Wide-Neighborhood Path Following},
  pages = {755--766},
  publisher = {ACM},
  year = {2026},
  doi = {10.1145/3798129.3800790},
  url = {https://doi.org/10.1145/3798129.3800790}
}

We develop a new interior point method for solving linear programs. Our algorithm is universal in the sense that it matches the number of iterations of any interior point method that uses a self-concordant barrier function up to a factor $O(n^{1.5}\log n)$ for an $n$-variable linear program in standard form.
The running time bounds of interior point methods depend on bit-complexity or condition measures that can be unbounded in the problem dimension. This is in contrast with the simplex method that always admits an exponential bound. Our algorithm also admits a combinatorial upper bound, terminating with an exact solution in $O(2^{n} n^{1.5}\log(n))$ iterations. This complements previous work by Allamigeon, Benchimol, Gaubert, and Joswig (SIAGA 2018) that exhibited a family of instances where any path-following method must take exponentially many iterations.

@article{N-ipm_not_worse_than_simplex,
  journal = {SIAM Journal on Computing},
  doi = {10.1137/23M1554588},
  url = {https://epubs.siam.org/doi/10.1137/23M1554588},
  volume = {54},
  number = {5},
  pages = {FOCS22-178--FOCS22-264},
  author = {Allamigeon, Xavier and Dadush, Daniel and Loho, Georg and Natura, Bento and Végh, László A.},
  title = {Interior Point Methods Are Not Worse than Simplex},
  publisher = {SIAM},
  year = {2025}
}

We give a strongly polynomial algorithm for minimum cost generalized flow, and hence for optimizing any linear program with at most two non-zero entries per row, or at most two non-zero entries per column. Primal and dual feasibility were shown by Megiddo (SICOMP '83) and Végh (MOR '17) respectively. Our result can be viewed as progress towards understanding whether all linear programs can be solved in strongly polynomial time, also referred to as Smale's 9th problem. Our approach is based on the recent primal-dual interior point method (IPM) due to Allamigeon, Dadush, Loho, Natura and Végh (FOCS '22). The number of iterations needed by the IPM is bounded, up to a polynomial factor in the number of inequalities, by the straight line complexity of the central path. Roughly speaking, this is the minimum number of pieces of any piecewise linear curve that multiplicatively approximates the central path. As our main contribution, we show that the straight line complexity of any minimum cost generalized flow instance is polynomial in the number of arcs and vertices. By applying a reduction of Hochbaum (ORL '04), the same bound applies to any linear program with at most two non-zeros per column or per row. To be able to run the IPM, one requires a suitable initial point. For this purpose, we develop a novel multistage approach, where each stage can be solved in strongly polynomial time given the result of the previous stage. Beyond this, substantial work is needed to ensure that the bit complexity of each iterate remains bounded during the execution of the algorithm. For this purpose, we show that one can maintain a representation of the iterates as a low complexity convex combination of vertices. Our approach is black-box and can be applied to any log-barrier path following method.

@inproceedings{min-cost-gen-flow,
  year = {2024},
  doi = {10.1145/3618260.3649764},
  booktitle = {Proceedings of the 56th Annual ACM SIGACT Symposium on Theory of Computing (STOC)},
  author = {Dadush, Daniel and Koh, Zhuan Khye and Natura, Bento and Olver, Neil and Végh, László A.},
  keywords = {Optimization and Control (math.OC), Data Structures and Algorithms (cs.DS), FOS: Mathematics, FOS: Mathematics, FOS: Computer and information sciences, FOS: Computer and information sciences},
  title = {A strongly polynomial algorithm for linear programs with at most two non-zero entries per row or column},
}