James Renegar
Affiliations: | Operations Research and Information Engineering | Cornell University, Ithaca, NY, United States |
Area:
Operations Research, Applied MathematicsGoogle:
"James Renegar"Children
Sign in to add trainee| Chek B. Chua | grad student | 2003 | Cornell |
| Yuriy A. Zinchenko | grad student | 2006 | Cornell |
| Mutaira Sondjaja | grad student | 2014 | Cornell |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Renegar J. (2019) Accelerated first-order methods for hyperbolic programming Mathematical Programming. 173: 1-35 |
| Renegar J. (2016) "Efficient" Subgradient Methods for General Convex Optimization Siam Journal On Optimization. 26: 2649-2676 |
| Renegar J. (2006) Hyperbolic programs, and their derivative relaxations Foundations of Computational Mathematics. 6: 59-79 |
| Peña J, Renegar J. (2000) Computing approximate solutions for convex conic systems of constraints Mathematical Programming. 87: 351-383 |
| Renegar J. (1996) Condition numbers, the barrier method, and the conjugate-gradient method Siam Journal On Optimization. 6: 879-912 |
| Renegar J. (1995) Incorporating Condition Measures into the Complexity Theory of Linear Programming Siam Journal On Optimization. 5: 506-524 |
| Renegar J. (1995) Linear programming, complexity theory and elementary functional analysis Mathematical Programming. 70: 279-351 |
| Renegar J. (1994) Some perturbation theory for linear programming Mathematical Programming. 65: 73-91 |
| Renegar J. (1994) Is It Possible to Know a Problem Instance Is Ill-Posed?. Some Foundations for a General Theory of Condition Numbers Journal of Complexity. 10: 1-56 |
| Renegar J. (1992) On the computational complexity of approximating solutions for real algebraic formulae Siam Journal On Computing. 21: 1008-1025 |