Back to search

Path-Following Methods for Linear Programming

Data up to Jan 2025

Published1992
Citations345
References87

Total Citations Per Year

Abstract

References (87)

Theory of Linear and Integer Programming

2000 • 5,990 citations

A new polynomial-time algorithm for linear programming

1984 • 4,898 citations

Linear Programming and Extensions

1963 • 2,647 citations

Nonlinear Programming: Sequential Unconstrained Minimization Techniques

1968 • 2,280 citations

Polynomial algorithms in linear programming

1980 • 2,063 citations

Nonlinear Programming--Sequential Unconstrained Minimization Techniques

1969 • 1,757 citations

On the Implementation of a Primal-Dual Interior Point Method

1992 • 1,591 citations

Computational methods in optimization

1971 • 971 citations

HOW GOOD IS THE SIMPLEX ALGORITHM

1970 • 811 citations

Linear Programming in Linear Time When the Dimension Is Fixed

1984 • 685 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 Unified Approach to Interior Point Algorithms for Linear Complementarity Problems

1991 • 533 citations

A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs

1986 • 494 citations

Theory of Linear and Integer Programming

1987 • 493 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 implementation of Karmarkar's algorithm for linear programming

1989 • 424 citations

Feature Article—The Ellipsoid Method: A Survey

1981 • 379 citations

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

2006 • 359 citations

The polynomial solvability of convex quadratic programming

1980 • 358 citations

A modification of karmarkar's linear programming algorithm

1986 • 358 citations

The Ellipsoid Method: A Survey

1980 • 349 citations

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

1989 • 337 citations

A variation on Karmarkar’s algorithm for solving linear programming problems

1986 • 332 citations

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

1989 • 330 citations

An O(n 3 L) potential reduction algorithm for linear programming

1991 • 295 citations

An Implementation of a Primal-Dual Interior Point Method for Linear Programming

1989 • 210 citations

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

1989 • 204 citations

A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension

1990 • 204 citations

Decomposition and Nondifferentiable Optimization with the Projective Algorithm

1992 • 203 citations

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

1990 • 197 citations

Progress in mathematical programming — interior-point and related methods

1990 • 182 citations

An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problems

1991 • 174 citations

The Simplex Method

1987 • 160 citations

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

1990 • 159 citations

An extension of Karmarkar's algorithm for linear programming using dual variables

1986 • 153 citations

A Centered Projective Algorithm for Linear Programming

1990 • 153 citations

On the complexity of approximating the maximal inscribed ellipsoid for a polytope

1993 • 152 citations

Boundary Behavior of Interior Point Algorithms in Linear Programming

1989 • 142 citations

Khachiyan’s algorithm for linear programming

1981 • 141 citations

A polynomial newton method for linear programming

1986 • 138 citations

The Efficiency of the Simplex Method: A Survey

1987 • 128 citations

A monotonic projective algorithm for fractional linear programming

1986 • 109 citations

Utilization of the operation of space dilatation in the minimization of convex functions

1972 • 105 citations

Limiting behavior of the affine scaling continuous trajectories for linear programming problems

1991 • 105 citations

A variant of Karmarkar's linear programming algorithm for problems in standard form

1987 • 95 citations

Solving matching problems with linear programming

1985 • 93 citations

Solving combinatorial optimization problems using Karmarkar's algorithm

1992 • 81 citations

Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming

1987 • 78 citations

Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function

1991 • 76 citations

New Algorithms in Convex Programming Based on a Notion of “Centre” (for Systems of Analytic Inequalities) and on Rational Extrapolation

1988 • 74 citations

On finding a vertex solution using interior point methods

1991 • 73 citations

Cutting planes and column generation techniques with the projective algorithm

1990 • 67 citations

Conical projection algorithms for linear programming

1989 • 67 citations

A survey of search directions in interior point methods for linear programming

1991 • 67 citations

Computational experience with a dual affine variant of Karmarkar's method for linear programming

1987 • 64 citations

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

1990 • 62 citations

Polynomial affine algorithms for linear programming

1990 • 58 citations

On the classical logarithmic barrier function method for a class of smooth convex programming problems

1992 • 53 citations

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

1990 • 51 citations

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

1991 • 50 citations

A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs

1991 • 47 citations

A new polynomial time method for a linear complementarity problem

1992 • 47 citations

Global ellipsoidal approximations and homotopy methods for solving convex analytic programs

1990 • 46 citations

An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations

1990 • 45 citations

Chapter II Linear programming

1989 • 41 citations

A Class of Projective Transformations for Linear Programming

1990 • 40 citations

A potential-function reduction algorithm for solving a linear program directly from an infeasible “warm start”

1991 • 39 citations

On the method of analytic centers for solving smooth convex programs

2006 • 38 citations

Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method

1991 • 36 citations

Homotopy techniques in linear programming

1986 • 36 citations

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

1989 • 33 citations

Long steps in an O(n 3 L) algorithm for linear programming

1992 • 32 citations

Theoretical efficiency of a shifted-barrier-function algorithm for linear programming

1991 • 32 citations

On the convexity of the multiplicative version of Karmarkar's potential function

1988 • 24 citations

Convergence and Boundary Behavior of the Projective Scaling Trajectories for Linear Programming

1991 • 22 citations

New purification algorithms for linear programming

1988 • 18 citations

On the Continuous Trajectories for a Potential Reduction Algorithm for Linear Programming

1992 • 13 citations

A potential-reduction variant of Renegar's short-step path-following method for linear programming

1991 • 13 citations

O(nL)-iteration and O(n3L)-operation potential reduction algorithms for linear programming

1991 • 11 citations

Interior point algorithms for linear programming with inequality constraints

1991 • 10 citations

A Polynomial Method of Weighted Centers for Convex Quadratic Programming

1991 • 9 citations

On combined phase 1-phase 2 projective methods for linear programming

1993 • 8 citations

On lower bound updates in primal potential reduction methods for linear programming

1991 • 5 citations

Errata

1991 • 4 citations

Affine and projective transformations in nondifferentiable optimization

1988 • 3 citations

Cited By (0)

Loading...