James Renegar - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 28 from 28

2022

A Simple Nearly Optimal Restart Scheme For Speeding Up First-Order MethodsJames Renegar, Benjamin Grimmer. focm, 22(1):211-256, 2022. [doi]

2019

Accelerated first-order methods for hyperbolic programmingJames Renegar. mp, 173(1-2):1-35, 2019. [doi]

2016

"Efficient" Subgradient Methods for General Convex OptimizationJames Renegar. siamjo, 26(4):2649-2676, 2016. [doi]

2015

ForewordTeresa Krick, James Renegar. focm, 15(1):1-2, 2015. [doi]

2013

Central Swaths - A Generalization of the Central PathJames Renegar. focm, 13(3):405-454, 2013. [doi]

2006

Hyperbolic Programs, and Their Derivative RelaxationsJames Renegar. focm, 6(1):59-79, 2006. [doi]

2005

ForewordLenore Blum, Felipe Cucker, Tomaso Poggio, James Renegar, Michael Shub. focm, 5(4):349, 2005. [doi]

2001

A mathematical view of interior-point methods in convex optimizationJames Renegar. MPS-SIAM series on optimization, SIAM, 2001.

2000

Computing approximate solutions for convex conic systems of constraintsJavier Peña, James Renegar. mp, 87(3):351-383, 2000. [doi]

1996

Condition Numbers, the Barrier Method, and the Conjugate-Gradient MethodJames Renegar. siamjo, 6(4):879-912, 1996. [doi]

1995

Linear programming, complexity theory and elementary functional analysisJames Renegar. mp, 70:279-351, 1995. [doi]

Incorporating Condition Measures into the Complexity Theory of Linear ProgrammingJames Renegar. siamjo, 5(3):506-524, 1995. [doi]

1994

Is It Possible to Know a Problem Instance Is Ill-Posed?: Some Foundations for a General Theory of Condition NumbersJames Renegar. jc, 10(1):1-56, 1994. [doi]

Some perturbation theory for linear programmingJames Renegar. mp, 65:73-91, 1994.

1992

On the Computational Complexity of Approximating Solutions for Real Algebraic FormulaeJames Renegar. SICOMP, 21(6):1008-1025, 1992.

Unified complexity analysis for Newton LP methodsJames Renegar, Michael Shub. mp, 53:1-16, 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 RealsJames Renegar. JSC, 13(3):255-300, 1992.

On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part III: Quantifier EliminationJames Renegar. JSC, 13(3):329-352, 1992.

On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part II: The General Decision Problem. Preliminaries for Quantifier EliminationJames Renegar. JSC, 13(3):301-328, 1992.

1990

Recent Progress on the Complexity of the Decision Problem for the RealsJames Renegar. dimacs 1991: 287-308

1989

On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of PolynomialsJames Renegar. SICOMP, 18(2):350-370, 1989.

1988

A Faster PSPACE Algorithm for Deciding the Existential Theory of the RealsJames Renegar. focs 1988: 291-295

Rudiments of an average case complexity theory for piecewise-linear path following algorithmsJames Renegar. mp, 40(1-3):113-163, 1988. [doi]

A polynomial-time algorithm, based on Newton's method, for linear programmingJames Renegar. mp, 40(1-3):59-93, 1988. [doi]

1987

On the worst-case arithmetic complexity of approximating zeros of polynomialsJames Renegar. jc, 3(2):90-113, 1987. [doi]

On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex PolynomialsJames Renegar. mor, 12(1):121-148, 1987. [doi]

1985

On the complexity of a piecewise linear algorithm for approximating roots of complex polynomialsJames Renegar. mp, 32(3):301-318, 1985. [doi]

On the cost of approximating all roots of a complex polynomialJames Renegar. mp, 32(3):319-336, 1985. [doi]

Sign in or sign up to see more results.

runs on WebDSL