Peter Bürgisser, Thomas Lickteig, et al.
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
Jonathan Brezin, Michael Shub
Bulletin of the Brazilian Mathematical Society
Jean-Pierre Dedieu, Myong-Hi Kim, et al.
Foundations of Computational Mathematics
Paper
Stable ergodicity
Charles Pugh, Michael Shub, et al.
Bulletin of the American Mathematical Society