An optimal-basis identification technique for interior-point linear programming algorithms

DOI10.1016/0024-3795(91)90281-ZzbMath0737.65052WikidataQ114852068 ScholiaQ114852068MaRDI QIDQ1174842

Yin Zhang, Richard A. Tapia

Publication date: 25 June 1992

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

convergencelinear programminginterior-point methodsoptimal basis

Mathematics Subject Classification ID

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

Related Items

Numerical experiments with the symmetric affine scaling algorithm on degenerate linear programming problema, Degeneracy in interior point methods for linear programming: A survey, An \(\varepsilon\)-sensitivity analysis in the primal-dual interior point method

Cites Work

• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• Asymptotic behaviour of Karmarkar's method for linear programming
• An extension of Karmarkar's algorithm for linear programming using dual variables
• Computational experience with a dual affine variant of Karmarkar's method for linear programming
• A polynomial Newton method for linear programming
• Determining basic variables of optimal solutions in Karmarkar's new LP algorithm
• Containing and shrinking ellipsoids in the path-following algorithm
• An implementation of Karmarkar's algorithm for linear programming
• A variation on Karmarkar’s algorithm for solving linear programming problems
• Randomly generated polytopes for testing mathematical programming algorithms
• Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
• Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item