James Renegar

According to our database, James Renegar authored at least 28 papers between 1985 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2022

A Simple Nearly Optimal Restart Scheme For Speeding Up First-Order Methods.

James Renegar, Benjamin Grimmer

Found. Comput. Math., 2022

2019

Accelerated first-order methods for hyperbolic programming.

James Renegar

Math. Program., 2019

2016

"Efficient" Subgradient Methods for General Convex Optimization.

James Renegar

SIAM J. Optim., 2016

2015

Foreword.

Teresa Krick, James Renegar

Found. Comput. Math., 2015

2013

Central Swaths - A Generalization of the Central Path.

James Renegar

Found. Comput. Math., 2013

2006

Hyperbolic Programs, and Their Derivative Relaxations.

James Renegar

Found. Comput. Math., 2006

2005

Foreword.

Lenore Blum, Felipe Cucker, Tomaso A. Poggio, James Renegar, Michael Shub

Found. Comput. Math., 2005

2001

A mathematical view of interior-point methods in convex optimization.

James Renegar

MPS-SIAM series on optimization, SIAM, ISBN: 978-0-89871-502-6, 2001

2000

Computing approximate solutions for convex conic systems of constraints.

Javier Peña, James Renegar

Math. Program., 2000

1996

Condition Numbers, the Barrier Method, and the Conjugate-Gradient Method.

James Renegar

SIAM J. Optim., 1996

1995

Incorporating Condition Measures into the Complexity Theory of Linear Programming.

James Renegar

SIAM J. Optim., 1995

Linear programming, complexity theory and elementary functional analysis.

James Renegar

Math. Program., 1995

1994

Some perturbation theory for linear programming.

James Renegar

Math. Program., 1994

Is It Possible to Know a Problem Instance Is Ill-Posed?: Some Foundations for a General Theory of Condition Numbers.

James Renegar

J. Complex., 1994

1992

On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae.

James Renegar

SIAM J. Comput., 1992

Unified complexity analysis for Newton LP methods.

James Renegar, Michael Shub

Math. Program., 1992

On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part III: Quantifier Elimination.

James Renegar

J. Symb. Comput., 1992

On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part II: The General Decision Problem. Preliminaries for Quantifier Elimination.

James Renegar

J. Symb. Comput., 1992

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

J. Symb. Comput., 1992

1990

Recent Progress on the Complexity of the Decision Problem for the Reals.

James Renegar

Proceedings of the Discrete and Computational Geometry: Papers from the DIMACS Special Year, 1990

1989

On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials.

James Renegar

SIAM J. Comput., 1989

1988

Rudiments of an average case complexity theory for piecewise-linear path following algorithms.

James Renegar

Math. Program., 1988

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

James Renegar

Math. Program., 1988

A Faster PSPACE Algorithm for Deciding the Existential Theory of the Reals

James Renegar

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

1987

On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials.

James Renegar

Math. Oper. Res., 1987

On the worst-case arithmetic complexity of approximating zeros of polynomials.

James Renegar

J. Complex., 1987

1985

On the cost of approximating all roots of a complex polynomial.

James Renegar

Math. Program., 1985

On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials.

James Renegar

Math. Program., 1985