Jonathan Brezin, Michael Shub
Bulletin of the Brazilian Mathematical Society
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
Roy Adler, Bruce Kitchens, et al.
Discrete and Continuous Dynamical Systems
Michael Shub, Steve Smale
Journal of the American Mathematical Society
Michael Shub
Journal of Complexity