James Renegar

发表

A mathematical view of interior-point methods in convex optimization

James Renegar, J. Renegar, 2001, MPS-SIAM series on optimization.

Central Swaths

James Renegar, J. Renegar, 2010, Found. Comput. Math..

Unified complexity analysis for Newton LP methods

James Renegar, Michael Shub, M. Shub, 1992, Math. Program..

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

James Renegar, J. Renegar, 1992, J. Symb. Comput..

Linear programming, complexity theory and elementary functional analysis

James Renegar, J. Renegar, 1995, Math. Program..

On the cost of approximating all roots of a complex polynomial

James Renegar, J. Renegar, 1985, Math. Program..

A faster PSPACE algorithm for deciding the existential theory of the reals

James Renegar, J. Renegar, 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

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

James Renegar, J. Renegar, 1987, J. Complex..

Foreword

James Renegar, Teresa Krick, J. Renegar, 2015, Foundations of Computational Mathematics.

Incorporating Condition Measures into the Complexity Theory of Linear Programming

James Renegar, J. Renegar, 1995, SIAM J. Optim..

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

James Renegar, J. Renegar, 1985, Math. Program..

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. Renegar, 1992, J. Symb. Comput..

A framework for applying subgradient methods

James Renegar, 2019 .

Computing approximate solutions for convex conic systems of constraints

James Renegar, Javier Peña, Javier F. Pena, 2000, Math. Program..

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

James Renegar, J. Renegar, 1996, SIAM J. Optim..

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

James Renegar, J. Renegar, 1994, J. Complex..

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

James Renegar, J. Renegar, 1987, Math. Oper. Res..

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

James Renegar, J. Renegar, 1990, Discrete & Computational Geometry.

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

James Renegar, 1989, SIAM J. Comput..

"Efficient" Subgradient Methods for General Convex Optimization

James Renegar, J. Renegar, 2016, SIAM J. Optim..

Ill-Posed Problem Instances

James Renegar, 1993 .

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. Renegar, 1992, J. Symb. Comput..

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

James Renegar, J. Renegar, 1988, Math. Program..

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

James Renegar, J. Renegar, 1988, Math. Program..

Hyperbolic Programs, and Their Derivative Relaxations

James Renegar, J. Renegar, 2006, Found. Comput. Math..

Accelerated first-order methods for hyperbolic programming

James Renegar, J. Renegar, 2015, Mathematical Programming.

Foreword

James Renegar, Felipe Cucker, Tomaso A. Poggio, 2005, Found. Comput. Math..

On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae

James Renegar, J. Renegar, 1992, SIAM J. Comput..

A Different Perspective On The Stochastic Convex Feasibility Problem

James Renegar, Song Zhou, J. Renegar, 2021, 2108.12029.

On the computational complexity and geome-try of the first-order theory of the reals

James Renegar, 1992 .

A Framework for Applying Subgradient Methods to Conic Optimization Problems

James Renegar, J. Renegar, 2015, 1503.02611.

Towards a computational complexity theory that uses approximate data and knowledge

James Renegar, Sharon K. Filipowski, 1993 .

A Polynomial-Time Affine-Scaling Method for Semidefinite and Hyperbolic Programming

James Renegar, Mutiara Sondjaja, J. Renegar, 2014, 1410.6734.

Central Swaths (A Generalization of the Central Path)

James Renegar, J. Renegar, 2010 .