A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases (Q3955153): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stabilization of the simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Automatic Scaling of Matrices for Gaussian Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Sparsity Orderings for Obtaining a Pivotal Sequence in Gaussian Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updated triangular factors of the basis to maintain sparsity in the product form simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Bartels—Golub decomposition for linear programming bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reinversion with the preassigned pivot procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bump triangular dynamic factorization algorithm for the simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Elimination form of the Inverse and its Application to Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolution of Linear Programming Computing Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degeneracy exploiting LU factorization for the simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on the Stability of Gaussian Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivoting for Size and Sparsity in Linear Programming Inversion Routes / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01585094 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988390398 / rank
 
Normal rank

Latest revision as of 09:26, 30 July 2024

scientific article
Language Label Description Also known as
English
A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
scientific article

    Statements

    A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases (English)
    0 references
    0 references
    1982
    0 references
    test results
    0 references
    decompositions
    0 references
    updating lp basis factorizations
    0 references
    simplex method
    0 references
    implementation
    0 references
    Bartels and Golub algorithm
    0 references
    sparse matrices
    0 references
    Forrest and Fomlin algorithm
    0 references
    computational comparison
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references