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
Felipe Cucker, Michael Shub
Theoretical Computer Science
Paper
Ergodic attractors
Charles Pugh, Michael Shub
Trans. Am. Math. Soc.
Charles Pugh, Michael Shub, et al.
Duke Mathematical Journal