Using a Massively Parallel Processor to Solve Large Sparse Linear Programs by an Interior-Point Method (Q4389258): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a Massively Parallel Processor to Solve Large Sparse Linear Programs by an Interior-Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Study of the Augmented System and Column-Splitting Approaches for Solving Two-Stage Stochastic Linear Programs by Interior-Point Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving symmetric indefinite systems in an interior-point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly Parallel Sparse Cholesky Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming / 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: Symmetric indefinite systems for interior point methods / rank
 
Normal rank

Revision as of 11:30, 28 May 2024

scientific article; zbMATH DE number 1151292
Language Label Description Also known as
English
Using a Massively Parallel Processor to Solve Large Sparse Linear Programs by an Interior-Point Method
scientific article; zbMATH DE number 1151292

    Statements

    Identifiers

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