Updating lower bounds when using Karmarkar's projective algorithm for linear programming
From MaRDI portal
Publication:1321368
DOI10.1007/BF00940704zbMath0792.90044OpenAlexW2032861665MaRDI QIDQ1321368
Publication date: 27 April 1994
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00940704
Cites Work
- A new polynomial-time algorithm for linear programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- An extension of Karmarkar's algorithm for linear programming using dual variables
- A polynomial Newton method for linear programming
- Conical projection algorithms for linear programming
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
- On lower bound updates in primal potential reduction methods for linear programming
- A survey of search directions in interior point methods for linear programming
- Search directions for interior linear-programming methods
- A variant of Karmarkar's linear programming algorithm for problems in standard form
- Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
- Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
- A Variant of Karmarkar’s Linear Programming Algorithm for Problems with Some Unrestricted Variables
- Implementation of a Dual Affine Interior Point Algorithm for Linear Programming
