4 citations · 10 across the 5 of their papers we have counts for
5 papers
The ellipsoid method redux
Michael J. Todd
We reconsider the ellipsoid method for linear inequalities. Using the ellipsoid representation of Burrell and Todd, we show the method can be viewed as coordinate descent on the vo…
An Oblivious Ellipsoid Algorithm for Solving a System of (In)Feasible Linear Inequalities
Jourdain Lamperski, Robert M. Freund, Michael J. Todd
The ellipsoid algorithm is a fundamental algorithm for computing a solution to the system of linear inequalities in variables when its set of solutio…
Can unit right -simplices cover a right -simplex with shortest side ?
Michael J. Todd
In a famous short paper, Conway and Soifer show that equilateral triangles with edge length 1 can cover one with side . We provide a generalization to dimensio…
An improved Kalai-Kleitman bound for the diameter of a polyhedron
Michael J. Todd
Kalai and Kleitman established the bound for the diameter of a -dimensional polyhedron with facets. Here we improve the bound slightly to …
A Robust Robust Optimization Result
Martina Gancarova, Michael Todd
We study the loss in objective value when an inaccurate objective is optimized instead of the true one, and show that "on average" this loss is very small, for an arbitrary compact…