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