James Renegar

On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals

James Renegar · Journal of Symbolic Computation · 1992 · 622 citations

Computing, Computer Science, Mathematics +14

A polynomial-time algorithm, based on Newton's method, for linear programming

James Renegar · Mathematical Programming · 1988 · 593 citations

Computing, Computer Science, Algorithms +7

On the computational complexity and geometry of the first-order theory of the reals. Part III: Quantifier elimination

James Renegar · Journal of Symbolic Computation · 1992 · 277 citations

Computing, Computer Science, Mathematics +13

Linear programming, complexity theory and elementary functional analysis

James Renegar · Mathematical Programming · 1995 · 239 citations

Computing, Computer Science, Mathematics +12

Some perturbation theory for linear programming

James Renegar · Mathematical Programming · 1994 · 210 citations

Natural Sciences, Computer Science, Mathematics +7