James Renegar

3.8k total citations
29 papers, 2.1k citations indexed

About

James Renegar is a scholar working on Computational Theory and Mathematics, Numerical Analysis and Mathematical Physics. According to data from OpenAlex, James Renegar has authored 29 papers receiving a total of 2.1k indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Computational Theory and Mathematics, 12 papers in Numerical Analysis and 5 papers in Mathematical Physics. Recurrent topics in James Renegar's work include Polynomial and algebraic computation (11 papers), Advanced Optimization Algorithms Research (11 papers) and Numerical Methods and Algorithms (7 papers). James Renegar is often cited by papers focused on Polynomial and algebraic computation (11 papers), Advanced Optimization Algorithms Research (11 papers) and Numerical Methods and Algorithms (7 papers). James Renegar collaborates with scholars based in United States and Argentina. James Renegar's co-authors include M. Shub, S. Smale, Javier Peña, Michael Shub, Stephen T. Smale and Térésa Krick and has published in prestigious journals such as Mathematical Programming, SIAM Journal on Computing and SIAM Journal on Optimization.

In The Last Decade

James Renegar

28 papers receiving 1.9k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
James Renegar United States 19 1.5k 987 391 306 170 29 2.1k
Monique Laurent Netherlands 24 1.5k 1.0× 829 0.8× 214 0.5× 337 1.1× 97 0.6× 125 2.2k
H. Woźniakowski United States 23 813 0.5× 1.2k 1.3× 418 1.1× 326 1.1× 103 0.6× 83 2.3k
Etienne de Klerk Netherlands 22 1.4k 0.9× 1.3k 1.3× 381 1.0× 216 0.7× 229 1.3× 89 1.9k
Alexander P. Morgan United States 25 1.1k 0.7× 636 0.6× 717 1.8× 195 0.6× 946 5.6× 50 2.6k
George Labahn Canada 25 1.0k 0.7× 270 0.3× 218 0.6× 532 1.7× 71 0.4× 94 2.1k
Marie-Françoise Roy France 17 1.5k 1.0× 183 0.2× 493 1.3× 388 1.3× 138 0.8× 57 2.1k
George P. H. Styan Canada 26 1.4k 1.0× 493 0.5× 102 0.3× 204 0.7× 215 1.3× 96 2.7k
Komei Fukuda Switzerland 17 743 0.5× 238 0.2× 97 0.2× 235 0.8× 243 1.4× 63 1.7k
Alexander Barvinok United States 20 632 0.4× 230 0.2× 168 0.4× 289 0.9× 56 0.3× 63 1.5k
Richard Pollack United States 25 1.5k 1.0× 156 0.2× 539 1.4× 346 1.1× 136 0.8× 76 3.0k

Countries citing papers authored by James Renegar

Since Specialization
Citations

This map shows the geographic impact of James Renegar's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by James Renegar with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites James Renegar more than expected).

Fields of papers citing papers by James Renegar

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by James Renegar. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by James Renegar. The network helps show where James Renegar may publish in the future.

Co-authorship network of co-authors of James Renegar

This figure shows the co-authorship network connecting the top 25 collaborators of James Renegar. A scholar is included among the top collaborators of James Renegar based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with James Renegar. James Renegar is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Krick, Térésa & James Renegar. (2015). Foreword. Foundations of Computational Mathematics. 15(1). 1–2.
2.
Renegar, James. (2006). Hyperbolic Programs, and Their Derivative Relaxations. Foundations of Computational Mathematics. 6(1). 59–79. 69 indexed citations
3.
Peña, Javier & James Renegar. (2000). Computing approximate solutions for convex conic systems of constraints. Mathematical Programming. 87(3). 351–383. 37 indexed citations
4.
Renegar, James, Michael Shub, & Stephen T. Smale. (1996). The mathematics of numerical analysis : 1995 AMS-SIAM Summer Seminar in Applied Mathematics, July 17-August 11, 1995, Park City, Utah. American Mathematical Society eBooks. 14 indexed citations
5.
Renegar, James, M. Shub, & S. Smale. (1996). The mathematics of numerical analysis. OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information). 60 indexed citations
6.
Renegar, James. (1996). Condition Numbers, the Barrier Method, and the Conjugate-Gradient Method. SIAM Journal on Optimization. 6(4). 879–912. 28 indexed citations
7.
Renegar, James. (1995). Linear programming, complexity theory and elementary functional analysis. Mathematical Programming. 70(1-3). 279–351. 141 indexed citations
8.
Renegar, James. (1994). Is It Possible to Know a Problem Instance Is Ill-Posed?. Journal of Complexity. 10(1). 1–56. 19 indexed citations
9.
Renegar, James. (1993). Notes on the Efficiency of the Barrier Method. eCommons (Cornell University). 1 indexed citations
10.
Renegar, James, et al.. (1993). Towards a computational complexity theory that uses approximate data and knowledge. 3 indexed citations
13.
Renegar, James. (1992). On the computational complexity and geometry of the first-order theory of the reals. Part III: Quantifier elimination. Journal of Symbolic Computation. 13(3). 329–352. 149 indexed citations
14.
Renegar, James. (1992). On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae. SIAM Journal on Computing. 21(6). 1008–1025. 26 indexed citations
15.
Renegar, James. (1990). Computational complexity of solving real algebraic formulae. eCommons (Cornell University). 3 indexed citations
16.
Renegar, James. (1989). On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials. SIAM Journal on Computing. 18(2). 350–370. 27 indexed citations
17.
Renegar, James. (1989). On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I. eCommons (Cornell University). 22 indexed citations
18.
Renegar, James. (1988). A polynomial-time algorithm, based on Newton's method, for linear programming. Mathematical Programming. 40-40(1-3). 59–93. 359 indexed citations
19.
Renegar, James. (1987). On the worst-case arithmetic complexity of approximating zeros of polynomials. Journal of Complexity. 3(2). 90–113. 93 indexed citations
20.
Renegar, James. (1987). On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials. Mathematics of Operations Research. 12(1). 121–148. 34 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026