Karl Heinz Borgwardt
-
Interior-point methods: worst case and average case analysis of a phase-I algorithm and a termination procedure
Journal of Complexity
On the probabilistic complexity of finding an approximate solution for linear programming
Due to an error in typesetting, an incorrect version of Figure 1 was printed as part of this paper in Mathematics of Operations Research, Vol. 24 No. 3, August 1999, pp. 544-603. The paper is reprinted correctly.