Condition numbers, the barrier method, and the conjugate-gradient method

SIAM Journal on Optimization

Volumn 6, Issue 4, 1996, Pages 879-912

  Renegar, James ^a  

^a Cornell University   (United States)

Author keywords

Barrier method; Complexity theory; Condition number; Conjugate gradient method; Interior point method; Linear programming

Indexed keywords

EID: 0030517078     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S105262349427532X     Document Type: Article

References (6)

1. O. AXELSSON, Iterative Solution Methods, Cambridge University Press, Cambridge, UK, 1994.
2. R. J. DUFFIN, Infinite programs, in Linear Inequalities and Related Systems, H. W. Kuhn and A. W. Tucker, eds., Princeton University Press, Princeton, NJ, 1956, pp. 157-170.
3. YU. E. NESTEROV AND A. S. NEMIROVSKII, Interior Point Methods in Convex Optimization: Theory and Applications, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1993.
4. J. RENEGAR, Some perturbation theory for linear programming, Math. Programming, 65 (1994), pp. 73-92.
5. _, Lecture Notes on the Efficiency of Newton's Method for Convex Optimization in Hilbert Spaces, preprint, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, 1993.
6. _, Linear programming, complexity theory and elementary functional analysis, Math. Programming, 70 (1995), pp. 279-351.