Adding and Deleting Constraints in the Logarithmic Barrier Method for LP
Data up to Jan 2025
Total Citations Per Year
Abstract
References (13)
A new polynomial-time algorithm for linear programming
1984 • 4,898 citations
An O(n 3 L) potential reduction algorithm for linear programming
1991 • 295 citations
A new algorithm for minimizing convex functions over convex sets
1989 • 181 citations
A polynomial method of approximate centers for linear programming
1992 • 92 citations
A Potential Reduction Algorithm Allowing Column Generation
1992 • 73 citations
Cutting planes and column generation techniques with the projective algorithm
1990 • 67 citations
A “build-down” scheme for linear programming
1990 • 56 citations
Experimental behavior of an interior point cutting plane algorithm for convex programming: an application to geometric programming
1994 • 49 citations
A logarithmic barrier cutting plane method for convex programming
1995 • 28 citations
A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming
1992 • 25 citations
Karmarkar's algorithm and combinatorial optimization problems
1988 • 18 citations
A build-up variant of the logarithmic barrier method for LP
1992 • 18 citations
An Active-Set Strategy in Interior Point Method for Linear Programming
1991 • 4 citations