Back to search

Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method

Data up to Jan 2025

Published1991
Citations50
References16

Total Citations Per Year

Abstract

References (16)

A new polynomial-time algorithm for linear programming

1984 • 4,898 citations

Nonlinear Programming--Sequential Unconstrained Minimization Techniques

1969 • 1,757 citations

Computational Methods in Optimization: A Unified Approach

1972 • 686 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

An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming

2006 • 359 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

An Algorithm for Solving Linear Programming Problems in O(n 3 L) Operations

1989 • 204 citations

An O(n 3 L) primal interior point algorithm for convex quadratic programming

1990 • 159 citations

Polynomial affine algorithms for linear programming

1990 • 58 citations

On the convergence of the method of analytic centers when applied to convex quadratic programs

1990 • 51 citations

A Locally Weil-Behaved Potential Function and a Simple Newton-Type Method for Finding the Center of a Polytope

1989 • 33 citations

Cited By (0)

Loading...