Power Series Variants of Karmarkar-Type Algorithms

DOI10.1002/j.1538-7305.1989.tb00316.xzbMath0682.90060MaRDI QIDQ4732304

Jeffrey C. Lagarias, Narendra K. Karmarkar, Pyng Wang, Lev Slutsman

Publication date: 1989

Published in: AT&T Technical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/j.1538-7305.1989.tb00316.x

zbMATH Keywords

approximations; interior-point linear programming; dual-affine scaling algorithm; power-series variants; primal-dual path-following

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C05: Linear programming

Related Items

Generating interior search directions for multiobjective linear programming, A quadratically convergent method for linear programming, Optimizing over three-dimensional subspaces in an interior-point method for linear programming, Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals, K-K-T multiplier estimates and objective function lower bounds from projective SUMT, On the choice of parameters for power-series interior point algorithms in linear programming, Multiple centrality corrections in a primal-dual method for linear programming, An implementation of Karmarkar's algorithm for linear programming, The curvature integral and the complexity of linear complementarity problems, A superquadratic infeasible-interior-point method for linear complementarity problems, Generating interior search directions for multiobjective linear programming using approximate gradients and efficient anchoring points