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

68Q25: Analysis of algorithms and problem complexity

65K05: Numerical mathematical programming methods

90C05: Linear programming

Related Items

An alternative derivation of the projective interior point method for linear programming through the least squares approach, A new potential reduction algorithm for smooth convex programming, Computing material collapse displacement fields on a Cray X-MP/48 by the LP primal affine scaling algorithm, On monotonicity in the scaled potential algorithm for linear programming, Theoretical efficiency of a shifted-barrier-function algorithm for linear programming, The affine-scaling direction for linear programming is a limit of projective-scaling directions, An \(O(n^ 3L)\) potential reduction algorithm for linear programming, A ``build-down scheme for linear programming, A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm, Exploiting special structure in Karmarkar's linear programming algorithm, A combined phase I-phase II projective algorithm for linear programming, An extension of Karmarkar's projective algorithm for convex quadratic programming, Cutting planes and column generation techniques with the projective algorithm, A polynomial-time algorithm for a class of linear complementarity problems, An optimal-basis identification technique for interior-point linear programming algorithms, An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems, On lower bound updates in primal potential reduction methods for linear programming, A combined phase I-phase II scaled potential algorithm for linear programming, A survey of search directions in interior point methods for linear programming, On Anstreicher's combined phase I-phase II projective algorithm for linear programming, Solving combinatorial optimization problems using Karmarkar's algorithm, Long steps in an \(O(n^ 3L)\) algorithm for linear programming, On combined phase 1-phase 2 projective methods for linear programming, Degeneracy in interior point methods for linear programming: A survey, Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming, Updating lower bounds when using Karmarkar's projective algorithm for linear programming, Interior-point algorithms for semi-infinite programming, Computing Karmarkar's projections quickly by using matrix factorization, A primal-dual interior-point method for linear programming based on a weighted barrier function, Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm, Linear updates for a single-phase projective method, An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming, El metodo de Karmarkar: Un estudio de sus variantes

Cites Work