Charles Pugh, Michael Shub
Applied Mathematics Letters
Paper
Unified complexity analysis for Newton LP methods
Abstract
We show that a theorem of Smale can be used to unify the polynomial-time bound proofs of several of the recent interior algorithms for linear programming and convex quadratic programming. © 1992 The Mathematical Programming Society, Inc.
Related
Michael Shub
Journal of Complexity
Michael Shub, Amie Wilkinson
Ergodic Theory and Dynamical Systems
Jean-Pierre Dedieu, Myong-Hi Kim, et al.
Foundations of Computational Mathematics