PCx: an interior-point code for linear programming (Q4504787): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Automatic Scaling of Matrices for Gaussian Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modification of the minimum-degree algorithm by multiple elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Role of Elimination Trees in Sparse Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Implementation of a Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / rank
 
Normal rank

Latest revision as of 12:52, 30 May 2024

scientific article; zbMATH DE number 1506384
Language Label Description Also known as
English
PCx: an interior-point code for linear programming
scientific article; zbMATH DE number 1506384

    Statements

    Identifiers