Unified complexity analysis for Newton LP methods

James Renegar; Michael Shub

doi:10.1007/BF01585691

Mathematical Programming

Paper

01 Jan 1992

Unified complexity analysis for Newton LP methods

View publication

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.

Paper

Generalized Knapsack problems and fixed degree separations

Felipe Cucker, Michael Shub

Theoretical Computer Science

Paper

Test complexity of generic polynomials

Peter Bürgisser, Thomas Lickteig, et al.

Journal of Complexity

Paper

Pathological foliations and removable zero exponents

Michael Shub, Amie Wilkinson

Inventiones Mathematicae

Paper

Stable ergodicity in homogeneous spaces

Jonathan Brezin, Michael Shub

Bulletin of the Brazilian Mathematical Society

View all publications

Abstract

Related

Generalized Knapsack problems and fixed degree separations

Test complexity of generic polynomials

Pathological foliations and removable zero exponents

Stable ergodicity in homogeneous spaces