James Renegar

Available identifiers

zbMath Open renegar.jamesMaRDI QIDQ358632

List of research outcomes

Publication	Date of Publication	Type
A simple nearly optimal restart scheme for speeding up first-order methods	2023-04-14	Paper
A Different Perspective On The Stochastic Convex Feasibility Problem	2021-08-26	Paper
Accelerated first-order methods for hyperbolic programming	2019-02-07	Paper
A Simple Nearly-Optimal Restart Scheme For Speeding-Up First Order Methods	2018-02-28	Paper
``Efficient” Subgradient Methods for General Convex Optimization	2016-12-13	Paper
A Framework for Applying Subgradient Methods to Conic Optimization Problems	2015-03-09	Paper
A Polynomial-Time Affine-Scaling Method for Semidefinite and Hyperbolic Programming	2014-10-24	Paper
Efficient First-Order Methods for Linear Programming and Semidefinite Programming	2014-09-19	Paper
Central swaths	2013-08-09	Paper
Hyperbolic programs, and their derivative relaxations	2006-10-27	Paper
A mathematical view of interior-point methods in convex optimization	2001-11-12	Paper
Computing approximate solutions for convex conic systems of constraints	2001-05-03	Paper
https://portal.mardi4nfdi.de/entity/Q4391222	1998-09-13	Paper
Condition Numbers, the Barrier Method, and the Conjugate-Gradient Method	1997-10-19	Paper
Linear programming, complexity theory and elementary functional analysis	1997-01-12	Paper
Incorporating Condition Measures into the Complexity Theory of Linear Programming	1996-06-04	Paper
Some perturbation theory for linear programming	1994-09-26	Paper
It is possible to know a problem instance is ill-posed? Some foundations for a general theory of condition numbers	1994-04-12	Paper
https://portal.mardi4nfdi.de/entity/Q4279727	1994-02-22	Paper
On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae	1993-03-09	Paper
https://portal.mardi4nfdi.de/entity/Q4011324	1992-09-27	Paper
https://portal.mardi4nfdi.de/entity/Q4011259	1992-09-27	Paper
On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination	1992-06-28	Paper
On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals	1992-06-28	Paper
On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination	1992-06-28	Paper
Unified complexity analysis for Newton LP methods	1992-06-28	Paper
On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials	1989-01-01	Paper
A polynomial-time algorithm, based on Newton's method, for linear programming	1988-01-01	Paper
Rudiments of an average case complexity theory for piecewise-linear path following algorithms	1988-01-01	Paper
On the worst-case arithmetic complexity of approximating zeros of polynomials	1987-01-01	Paper
On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials	1987-01-01	Paper
On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials	1985-01-01	Paper
On the cost of approximating all roots of a complex polynomial	1985-01-01	Paper

Research outcomes over time

This page was built for person: James Renegar