research
∙
06/17/2022
Interior point methods are not worse than Simplex
Whereas interior point methods provide polynomial-time linear programmin...
share
research
∙
02/17/2022
A Faster Interior-Point Method for Sum-of-Squares Optimization
We present a faster interior-point method for optimizing sum-of-squares ...
research
∙
02/16/2022
The Pareto cover problem
We introduce the problem of finding a set B of k points in [0,1]^n such ...
research
∙
11/15/2021
On Circuit Diameter Bounds via Circuit Imbalances
We study the circuit diameter of polyhedra, introduced by Borgwardt, Fin...
research
∙
08/08/2021
Circuit imbalance measures and linear programming
We study properties and applications of various circuit imbalance measur...
research
∙
09/10/2020
Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers
In breakthrough work, Tardos (Oper. Res. '86) gave a proximity based fra...
research
∙
04/18/2020
A Strongly Polynomial Label-Correcting Algorithm for Linear Systems with Two Variables per Inequality
We present a strongly polynomial label-correcting algorithm for solving ...
research
∙
12/12/2019
