Computing Karmarkar projections quickly
From MaRDI portal
Publication:1107438
DOI10.1007/BF01580753zbMath0652.90069MaRDI QIDQ1107438
Publication date: 1988
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Related Items
An extended variant of Karmarkar's interior point algorithm, A Faster Method For Computing Karmarkar's Projections For Large Number of Constraints, A survey of dynamic network flows, A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm, Long steps in an \(O(n^ 3L)\) algorithm for linear programming, Implementing cholesky factorization for interior point methods of linear programming, On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise, El metodo de Karmarkar: Un estudio de sus variantes, Computing Karmarkar's projections quickly by using matrix factorization, An interior point method, based on rank-1 updates, for linear programming, Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers, A quadratically convergent method for linear programming, Optimizing over three-dimensional subspaces in an interior-point method for linear programming, An \(O(n^ 3L)\) potential reduction algorithm for linear programming
Cites Work
- A monotonic projective algorithm for fractional linear programming
- A new polynomial-time algorithm for linear programming
- An extension of Karmarkar's algorithm for linear programming using dual variables
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- A variant of Karmarkar's linear programming algorithm for problems in standard form
- An experimental approach to karmarkar’s projective method for linear programming
- On the Modification of LDL T Factorizations
