Prior reduced fill-in in solving equations in interior point algorithms
From MaRDI portal
Publication:1197902
DOI10.1016/0167-6377(92)90024-WzbMATH Open0767.90044OpenAlexW2056574624MaRDI QIDQ1197902FDOQ1197902
Authors: John R. Birge, Robert M. Freund, Robert J. Vanderbei 
Publication date: 16 January 1993
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(92)90024-w
Recommendations
- scientific article; zbMATH DE number 724214
- Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming
- Numerical Factorization Methods for Interior Point Algorithms
- Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
- Detecting ``dense columns in interior point methods for linear programs
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- Affine-scaling for linear programs with free variables
- A survey of search directions in interior point methods for linear programming
- A variation on Karmarkar’s algorithm for solving linear programming problems
- A modification of Karmarkar's linear programming algorithm
- Generation of degenerate linear programming problems
Cited In (4)
This page was built for publication: Prior reduced fill-in in solving equations in interior point algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197902)
