Michael Shub, Steve Smale
SIAM Journal on Numerical Analysis
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
Paper
Opinion
Richard Karp, William Browder, et al.
The Mathematical Intelligencer
Roy Adler, Bruce Kitchens, et al.
Discrete and Continuous Dynamical Systems
Peter Bürgisser, Thomas Lickteig, et al.
Journal of Complexity