A Block-LU Update for Large-Scale Linear Programming

DOI10.1137/0613016MaRDI QIDQ3988985zbMATH OpenOpenAlexFDO

Authors Samuel K. Eldersveld, Michael A. Saunders

Publication date 28 June 1992

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0613016

zbMATH Keywords

matrix factorizationstabilitynumerical experimentssimplex methodupdatingtest problemsblock-LU updatelarge sparse linear programming problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Linear programming (90C05) Large-scale problems in mathematical programming (90C06)

Recommendations

• A fast LU update for linear programming
• scientific article; zbMATH DE number 4059114
• Novel update techniques for the revised simplex method
• scientific article; zbMATH DE number 3852785
• An efficient simplex LU factorization update

Cited in

(23)

• A simplex method algorithm using a double basis
• The double pivot simplex method
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
• Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
• A reduced proximal-point homotopy method for large-scale non-convex BQP
• A fast LU update for linear programming
• scientific article; zbMATH DE number 4059114 (Why is no real title available?)
• Complementarity framework for non linear dynamic analysis of skeletal structures with softening plastic hinges
• Novel update techniques for the revised simplex method
• A structure-preserving pivotal method for affine variational inequalities
• Approximating polyhedra with sparse inequalities
• scientific article; zbMATH DE number 3852785 (Why is no real title available?)
• An efficient simplex LU factorization update
• Updating the Triangular Factorization of a Matrix
• scientific article; zbMATH DE number 176402 (Why is no real title available?)
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
• scientific article; zbMATH DE number 3856811 (Why is no real title available?)
• An efficient basis update for asymptotic linear programming
• An efficient approach to updating simplex multipliers in the simplex algorithm
• Methods for convex and general quadratic programming
• scientific article; zbMATH DE number 1971712 (Why is no real title available?)
• scientific article; zbMATH DE number 3858836 (Why is no real title available?)
• A factorization with update procedures for a KKT matrix arising in direct optimal control

This page was built for publication: A Block-$LU$ Update for Large-Scale Linear Programming

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