Decomposed block Cholesky factorization in the Karmarkar algorithm. Solving a class of super large LP problems

DOI10.1016/0898-1221(90)90234-BzbMath0701.90060OpenAlexW1553426866MaRDI QIDQ914546

N. E. Zubov

Publication date: 1990

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(90)90234-b

zbMATH Keywords

Karmarkar algorithmdecomposed block Cholesky factorizationfactorization schememodified version

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Uses Software

• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• An implementation of Karmarkar's algorithm for linear programming

This page was built for publication: Decomposed block Cholesky factorization in the Karmarkar algorithm. Solving a class of super large LP problems