Michael Shub, Steve Smale
Journal of Complexity
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
Jean-Pierre Dedieu, Myong-Hi Kim, et al.
Foundations of Computational Mathematics
Roy Adler, Bruce Kitchens, et al.
Discrete and Continuous Dynamical Systems
Paper
Ergodic attractors
Charles Pugh, Michael Shub
Trans. Am. Math. Soc.