On the use of dense matrix techniques within sparse simplex

DOI10.1007/BF02025532MaRDI QIDQ1309853zbMATH OpenFDO

Authors Janez Barle, Janez Grad

Publication date 21 March 1994

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02025532

zbMATH Keywords

dense matrix techniquesSchur complement matrixsparse simplex linear programming

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• Novel update techniques for the revised simplex method
• A fast LU update for linear programming
• scientific article; zbMATH DE number 176402
• scientific article; zbMATH DE number 3852786

Cites work

• A note on splitting the bump in an elimination factorization
• A practical anti-cycling procedure for linearly constrained optimization
• An analysis of an available set of linear programming test problems
• Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
• scientific article; zbMATH DE number 446512 (Why is no real title available?)
• scientific article; zbMATH DE number 4059114 (Why is no real title available?)
• scientific article; zbMATH DE number 3537147 (Why is no real title available?)
• scientific article; zbMATH DE number 194668 (Why is no real title available?)
• Large sparse numerical optimization
• Manifestations of the Schur complement
• Matrix augmentation and partitioning in the updating of the basis inverse
• Matrix computations.
• On Exploiting Original Problem Data in the Inverse Representation of Linear Programming Bases
• Reinversion with the preassigned pivot procedure
• Spike swapping in basis reinversion
• Stable algorithm for updating denseLUfactorization after row or column exchange and row and column addition or deletion
• Stable modification of explicitLU factors for simplex updates
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method

Cited in

(4)

• Perturbed matrix inversion with application to LP simplex method
• Hyper-sparsity in the revised simplex method and how to exploit it
• Using dense matrix computations in the solution of sparse problems
• Splitting dense columns in sparse linear systems

This page was built for publication: On the use of dense matrix techniques within sparse simplex

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1309853)