default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames Renegar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j25]James Renegar, Benjamin Grimmer:
A Simple Nearly Optimal Restart Scheme For Speeding Up First-Order Methods. Found. Comput. Math. 22(1): 211-256 (2022)
2010 – 2019
- 2019
- [j24]James Renegar
:
Accelerated first-order methods for hyperbolic programming. Math. Program. 173(1-2): 1-35 (2019) - 2016
- [j23]James Renegar:
"Efficient" Subgradient Methods for General Convex Optimization. SIAM J. Optim. 26(4): 2649-2676 (2016) - 2015
- [j22]Teresa Krick, James Renegar:
Foreword. Found. Comput. Math. 15(1): 1-2 (2015) - 2013
- [j21]James Renegar:
Central Swaths - A Generalization of the Central Path. Found. Comput. Math. 13(3): 405-454 (2013)
2000 – 2009
- 2006
- [j20]James Renegar:
Hyperbolic Programs, and Their Derivative Relaxations. Found. Comput. Math. 6(1): 59-79 (2006) - 2005
- [j19]Lenore Blum, Felipe Cucker, Tomaso A. Poggio, James Renegar, Michael Shub:
Foreword. Found. Comput. Math. 5(4): 349 (2005) - 2001
- [b1]James Renegar:
A mathematical view of interior-point methods in convex optimization. MPS-SIAM series on optimization, SIAM 2001, ISBN 978-0-89871-502-6, pp. I-VII, 1-117 - 2000
- [j18]Javier Peña, James Renegar:
Computing approximate solutions for convex conic systems of constraints. Math. Program. 87(3): 351-383 (2000)
1990 – 1999
- 1996
- [j17]James Renegar:
Condition Numbers, the Barrier Method, and the Conjugate-Gradient Method. SIAM J. Optim. 6(4): 879-912 (1996) - 1995
- [j16]James Renegar:
Linear programming, complexity theory and elementary functional analysis. Math. Program. 70: 279-351 (1995) - [j15]James Renegar:
Incorporating Condition Measures into the Complexity Theory of Linear Programming. SIAM J. Optim. 5(3): 506-524 (1995) - 1994
- [j14]James Renegar:
Is It Possible to Know a Problem Instance Is Ill-Posed?: Some Foundations for a General Theory of Condition Numbers. J. Complex. 10(1): 1-56 (1994) - [j13]James Renegar:
Some perturbation theory for linear programming. Math. Program. 65: 73-91 (1994) - 1992
- [j12]James Renegar:
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. 13(3): 255-300 (1992) - [j11]James Renegar:
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. 13(3): 301-328 (1992) - [j10]James Renegar:
On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part III: Quantifier Elimination. J. Symb. Comput. 13(3): 329-352 (1992) - [j9]James Renegar, Michael Shub:
Unified complexity analysis for Newton LP methods. Math. Program. 53: 1-16 (1992) - [j8]James Renegar:
On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae. SIAM J. Comput. 21(6): 1008-1025 (1992) - 1990
- [c2]James Renegar:
Recent Progress on the Complexity of the Decision Problem for the Reals. Discrete and Computational Geometry 1990: 287-308
1980 – 1989
- 1989
- [j7]James Renegar:
On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials. SIAM J. Comput. 18(2): 350-370 (1989) - 1988
- [j6]James Renegar:
A polynomial-time algorithm, based on Newton's method, for linear programming. Math. Program. 40(1-3): 59-93 (1988) - [j5]James Renegar:
Rudiments of an average case complexity theory for piecewise-linear path following algorithms. Math. Program. 40(1-3): 113-163 (1988) - [c1]James Renegar:
A Faster PSPACE Algorithm for Deciding the Existential Theory of the Reals. FOCS 1988: 291-295 - 1987
- [j4]James Renegar:
On the worst-case arithmetic complexity of approximating zeros of polynomials. J. Complex. 3(2): 90-113 (1987) - [j3]James Renegar:
On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials. Math. Oper. Res. 12(1): 121-148 (1987) - 1985
- [j2]James Renegar:
On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials. Math. Program. 32(3): 301-318 (1985) - [j1]James Renegar:
On the cost of approximating all roots of a complex polynomial. Math. Program. 32(3): 319-336 (1985)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
