James Renegar

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