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)

USSR Computational Mathematics and Mathematicalâ€¦

1980

Highly Influential

5 Excerpts

The non-linear geometry of linear programming, 1. Affine and projective scaling trajectories, II. Legendre transform coordinates, IlI. Central trajectories

D. A. Bayer, J. C. Lagarias

preprints, AT&T Bell Laboratories (Murray Hillâ€¦

1986

Highly Influential

4 Excerpts

An algorithm for linear programming which requires O((m+ n)n2+(m + n)aSn)L) arithmetic operations

J. Lagarias, talk at Mathematical Sciences Research Institute Berkeley, +25 authorsMuzeum K6rut 6-8. P. Vaidya

Resolution of mathematical programming with non-linear constraints by the method of centers

P. Huard

in: J. Abadie, ed., Non-Linear Programming (Northâ€¦

1967

1 Excerpt

Similar Papers

Loading similar papersâ€¦

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}
}