James Renegar
James Renegar
Professor of Operations Research, Cornell University
Adresse e-mail validée de cornell.edu
Titre
Citée par
Citée par
Année
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 …
J Renegar
Journal of symbolic computation 13 (3), 255-299, 1992
7651992
A polynomial-time algorithm, based on Newton's method, for linear programming
J Renegar
Mathematical programming 40 (1), 59-93, 1988
7291988
A mathematical view of interior-point methods in convex optimization
J Renegar
Society for Industrial and Applied Mathematics, 2001
5442001
Linear programming, complexity theory and elementary functional analysis
J Renegar
Mathematical Programming 70 (1), 279-351, 1995
2911995
Some perturbation theory for linear programming
J Renegar
Cornell University Operations Research and Industrial Engineering, 1993
2561993
Incorporating condition measures into the complexity theory of linear programming
J Renegar
SIAM Journal on Optimization 5 (3), 506-524, 1995
1981995
On the worst-case arithmetic complexity of approximating zeros of polynomials
J Renegar
Journal of Complexity 3 (2), 90-113, 1987
1611987
Hyperbolic programs, and their derivative relaxations
J Renegar
Cornell University Operations Research and Industrial Engineering, 2004
1552004
A faster PSPACE algorithm for deciding the existential theory of the reals
J Renegar
Cornell University Operations Research and Industrial Engineering, 1988
1191988
On the worst-case arithmetic complexity of approximating zeros of systems of polynomials
J Renegar
SIAM Journal on Computing 18 (2), 350-370, 1989
761989
On the computational complexity and geometry of the first-order theory of the reals. Part III: Quantifier elimination
J Renegar
Journal of Symbolic Computation 13 (3), 329-352, 1992
701992
On the efficiency of Newton's method in approximating all zeros of a system of complex polynomials
J Renegar
Mathematics of operations research 12 (1), 121-148, 1987
701987
On the computational complexity and geometry of the first-order theory of the reals. Part II: The general decision problem. Preliminaries for quantifier elimination
J Renegar
Journal of Symbolic Computation 13 (3), 301-327, 1992
671992
Computing approximate solutions for convex conic systems of constraints
J Pena, J Renegar
Mathematical Programming 87 (3), 351-383, 2000
632000
Condition numbers, the barrier method, and the conjugate-gradient method
J Renegar
SIAM Journal on Optimization 6 (4), 879-912, 1996
491996
On the computational complexity of approximating solutions for real algebraic formulae
J Renegar
SIAM Journal on Computing 21 (6), 1008-1025, 1992
451992
Is it possible to know a problem instance is ill-posed?: some foundations for a general theory of condition numbers
J Renegar
Journal of Complexity 10 (1), 1-56, 1994
381994
Efficient first-order methods for linear programming and semidefinite programming
J Renegar
arXiv preprint arXiv:1409.5832, 2014
312014
Unified complexity analysis for Newton LP methods
J Renegar, M Shub
Mathematical programming 53 (1), 1-16, 1992
311992
On the cost of approximating all roots of a complex polynomial
J Renegar
Mathematical Programming 32 (3), 319-336, 1985
271985
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20