Cubically convergent method for locating a nearby vertex in linear programming

DOI10.1007/BF00940473zbMath0696.90036OpenAlexW2012126599MaRDI QIDQ911456

Richard A. Tapia, Yin Zhang

Publication date: 1990

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

fast convergencenondegenerate basic feasible solution

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• Unnamed Item
• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• Computational experience with a dual affine variant of Karmarkar's method for linear programming
• 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