An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence

A new polynomial-time algorithm for linear programming

1984 • 4,898 citations

Nonlinear Programming: Sequential Unconstrained Minimization Techniques

1968 • 2,280 citations

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

1988 • 587 citations

Pathways to the Optimal Set in Linear Programming

1989 • 585 citations

A Primal-Dual Interior Point Algorithm for Linear Programming

1989 • 490 citations

Interior path following primal-dual algorithms. part I: Linear programming

1989 • 482 citations

On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method

1986 • 439 citations

A polynomial-time algorithm for a class of linear complementarity problems

1989 • 337 citations

Interior path following primal-dual algorithms. part II: Convex quadratic programming

1989 • 330 citations

The nonlinear geometry of linear programming. II. Legendre transform coordinates and central trajectories

1989 • 107 citations

An algorithm for solving linear programming programs in O(n3L) operations

1988 • 34 citations