Asymptotic behaviour of Karmarkar's method for linear programming

DOI10.1007/BF01585736zbMath0697.90049OpenAlexW2066835433MaRDI QIDQ911987

Mirjana D. Radosavljevic-Nikolic, Miroslav D. Asic, Vera V. Kovacevic-Vujcic

Publication date: 1990

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01585736

zbMATH Keywords

rate of convergenceasymptotic behaviourdegenerate caseKarmarkar's method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items

On the improvement per iteration in Karmarkar's algorithm for linear programming, An optimal-basis identification technique for interior-point linear programming algorithms, Improving the rate of convergence of interior point methods for linear programming, Sparsity preserving preconditioners for linear systems in interior-point methods, Degeneracy in interior point methods for linear programming: A survey

Cites Work

• Unnamed Item
• Unnamed Item
• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• Intelligent gradient search in linear programming
• Introduction: New approaches to linear programming
• The iterative step in the linear programming algorithm of N. Karmarkar
• An extension of Karmarkar's algorithm for linear programming using dual variables
• Convergence results and numerical experiments on a linear programming hybrid algorithm
• Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• A variation on Karmarkar’s algorithm for solving linear programming problems
• A variable-metric variant of the Karmarkar algorithm for linear programming
• Boundary Behavior of Interior Point Algorithms in Linear Programming