James Renegar

From MaRDI portal
Person:358632

Available identifiers

zbMath Open renegar.jamesMaRDI QIDQ358632

List of research outcomes





PublicationDate of PublicationType
A simple nearly optimal restart scheme for speeding up first-order methods2023-04-14Paper
A Different Perspective On The Stochastic Convex Feasibility Problem2021-08-26Paper
Accelerated first-order methods for hyperbolic programming2019-02-07Paper
A Simple Nearly-Optimal Restart Scheme For Speeding-Up First Order Methods2018-02-28Paper
``Efficient” Subgradient Methods for General Convex Optimization2016-12-13Paper
A Framework for Applying Subgradient Methods to Conic Optimization Problems2015-03-09Paper
A Polynomial-Time Affine-Scaling Method for Semidefinite and Hyperbolic Programming2014-10-24Paper
Efficient First-Order Methods for Linear Programming and Semidefinite Programming2014-09-19Paper
Central swaths2013-08-09Paper
Hyperbolic programs, and their derivative relaxations2006-10-27Paper
A mathematical view of interior-point methods in convex optimization2001-11-12Paper
Computing approximate solutions for convex conic systems of constraints2001-05-03Paper
https://portal.mardi4nfdi.de/entity/Q43912221998-09-13Paper
Condition Numbers, the Barrier Method, and the Conjugate-Gradient Method1997-10-19Paper
Linear programming, complexity theory and elementary functional analysis1997-01-12Paper
Incorporating Condition Measures into the Complexity Theory of Linear Programming1996-06-04Paper
Some perturbation theory for linear programming1994-09-26Paper
It is possible to know a problem instance is ill-posed? Some foundations for a general theory of condition numbers1994-04-12Paper
https://portal.mardi4nfdi.de/entity/Q42797271994-02-22Paper
On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae1993-03-09Paper
https://portal.mardi4nfdi.de/entity/Q40113241992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40112591992-09-27Paper
On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination1992-06-28Paper
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 reals1992-06-28Paper
On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination1992-06-28Paper
Unified complexity analysis for Newton LP methods1992-06-28Paper
On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials1989-01-01Paper
A polynomial-time algorithm, based on Newton's method, for linear programming1988-01-01Paper
Rudiments of an average case complexity theory for piecewise-linear path following algorithms1988-01-01Paper
On the worst-case arithmetic complexity of approximating zeros of polynomials1987-01-01Paper
On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials1987-01-01Paper
On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials1985-01-01Paper
On the cost of approximating all roots of a complex polynomial1985-01-01Paper

Research outcomes over time

This page was built for person: James Renegar