On the use of dense matrix techniques within sparse simplex (Q1309853): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(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: Q3793939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix augmentation and partitioning in the updating of the basis inverse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large sparse numerical optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manifestations of the Schur complement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable modification of explicitLU factors for simplex updates / 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: A practical anti-cycling procedure for linearly constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix computations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Exploiting Original Problem Data in the Inverse Representation of Linear Programming Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable algorithm for updating dense<i>LU</i>factorization after row or column exchange and row and column addition or deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4113318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reinversion with the preassigned pivot procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spike swapping in basis reinversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on splitting the bump in an elimination factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of an available set of linear programming test problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:05, 22 May 2024

scientific article
Language Label Description Also known as
English
On the use of dense matrix techniques within sparse simplex
scientific article

    Statements

    On the use of dense matrix techniques within sparse simplex (English)
    0 references
    0 references
    0 references
    21 March 1994
    0 references
    dense matrix techniques
    0 references
    sparse simplex linear programming
    0 references
    Schur complement matrix
    0 references

    Identifiers