A polynomial-time algorithm, based on Newton's method, for linear programming

Abstract

The main motivation for this work was the idea that there should exist an easily understood polynomial time algorithm for linear programming, where both the algorithm and the proof of the polynomial time bound rely primarily on common ideas in the non-linear optimization literature (e.g. convergence of Newton's method). Although both the ellipsoid algorithm… (More)
DOI: 10.1007/BF01580724

Topics

Cite this paper

@article{Renegar1988APA, title={A polynomial-time algorithm, based on Newton's method, for linear programming}, author={James Renegar}, journal={Math. Program.}, year={1988}, volume={40}, pages={59-93} }