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
Michael Shub, Steve Smale
Journal of Complexity
Felipe Cucker, Michael Shub
Theoretical Computer Science
Charles Pugh, Michael Shub
Applied Mathematics Letters