Cubically convergent method for locating a nearby vertex in linear programming
From MaRDI portal
Publication:911456
DOI10.1007/BF00940473zbMath0696.90036MaRDI QIDQ911456
Publication date: 1990
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
65K05: Numerical mathematical programming methods
90C05: Linear programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
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