3 papers
math.OC2022
A Faster Interior-Point Method for Sum-of-Squares Optimization
Shunhua Jiang, Bento Natura, Omri Weinstein
We present a faster interior-point method for optimizing sum-of-squares (SOS) polynomials, which are a central tool in polynomial optimization and capture convex programming in the…
math.OC2022
The Pareto cover problem
Bento Natura, Meike Neuwohner, Stefan Weltge
We introduce the problem of finding a set of points in such that the expected cost of the cheapest point in that dominates a random point from is mi…
math.OC2020
Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers
Daniel Dadush, Bento Natura, László A. Végh
In breakthrough work, Tardos (Oper. Res. '86) gave a proximity based framework for solving linear programming (LP) in time depending only on the constraint matrix in the bit comple…