James Renegar

Publication Activity (10 Years)

Years Active: 1985-2022
Publications (10 Years): 3

Top Topics

Computationally Expensive

Exhaustive Search

Convex Optimization

Top Venues

Found. Comput. Math.

Publications

James Renegar, Benjamin Grimmer
A Simple Nearly Optimal Restart Scheme For Speeding Up First-Order Methods. Found. Comput. Math. 22 (1) (2022)
James Renegar
Accelerated first-order methods for hyperbolic programming. Math. Program. 173 (1-2) (2019)
James Renegar
"Efficient" Subgradient Methods for General Convex Optimization. SIAM J. Optim. 26 (4) (2016)
Teresa Krick, James Renegar
Foreword. Found. Comput. Math. 15 (1) (2015)
James Renegar
Central Swaths - A Generalization of the Central Path. Found. Comput. Math. 13 (3) (2013)
James Renegar
Hyperbolic Programs, and Their Derivative Relaxations. Found. Comput. Math. 6 (1) (2006)
Lenore Blum, Felipe Cucker, Tomaso A. Poggio, James Renegar, Michael Shub
Foreword. Found. Comput. Math. 5 (4) (2005)
Javier Peña, James Renegar
Computing approximate solutions for convex conic systems of constraints. Math. Program. 87 (3) (2000)
James Renegar
Condition Numbers, the Barrier Method, and the Conjugate-Gradient Method. SIAM J. Optim. 6 (4) (1996)
James Renegar
Linear programming, complexity theory and elementary functional analysis. Math. Program. 70 (1995)
James Renegar
Incorporating Condition Measures into the Complexity Theory of Linear Programming. SIAM J. Optim. 5 (3) (1995)
James Renegar
Is It Possible to Know a Problem Instance Is Ill-Posed?: Some Foundations for a General Theory of Condition Numbers. J. Complex. 10 (1) (1994)
James Renegar
Some perturbation theory for linear programming. Math. Program. 65 (1994)
James Renegar
On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part III: Quantifier Elimination. J. Symb. Comput. 13 (3) (1992)
James Renegar, Michael Shub
Unified complexity analysis for Newton LP methods. Math. Program. 53 (1992)
James Renegar
On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae. SIAM J. Comput. 21 (6) (1992)
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. J. Symb. Comput. 13 (3) (1992)
James Renegar
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. Symb. Comput. 13 (3) (1992)
James Renegar
Recent Progress on the Complexity of the Decision Problem for the Reals. Discrete and Computational Geometry (1990)
James Renegar
On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials. SIAM J. Comput. 18 (2) (1989)
James Renegar
A Faster PSPACE Algorithm for Deciding the Existential Theory of the Reals FOCS (1988)
James Renegar
A polynomial-time algorithm, based on Newton's method, for linear programming. Math. Program. 40 (1-3) (1988)
James Renegar
Rudiments of an average case complexity theory for piecewise-linear path following algorithms. Math. Program. 40 (1-3) (1988)
James Renegar
On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials. Math. Oper. Res. 12 (1) (1987)
James Renegar
On the worst-case arithmetic complexity of approximating zeros of polynomials. J. Complex. 3 (2) (1987)
James Renegar
On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials. Math. Program. 32 (3) (1985)
James Renegar
On the cost of approximating all roots of a complex polynomial. Math. Program. 32 (3) (1985)