The following pages link to (Q4114710):
Displaying 11 items.
- Dynamic factorization in large-scale optimization (Q1330893) (← links)
- A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems (Q2638951) (← links)
- Large-scale linear programming: Geometry, working bases and factorizations (Q3664825) (← links)
- Stable modification of explicitLU factors for simplex updates (Q3692731) (← links)
- A bump triangular dynamic factorization algorithm for the simplex method (Q3865837) (← links)
- A degeneracy exploiting LU factorization for the simplex method (Q3885512) (← links)
- The octahedral algorithm, a new simplicial fixed point algorithm (Q3930548) (← links)
- Solving staircase linear programs by the simplex method, 1: Inversion (Q3948887) (← links)
- Large-scale linearly constrained optimization (Q4162963) (← links)
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results (Q4165158) (← links)
- Permutations in the Factorization of Simplex Bases (Q5139619) (← links)
