.png){kind=icon}
Return
Using a massively parallel processor to solve large sparse linear programs by an interior-point method
.png){kind=icon}
PRE
AI
DOI：10.1137/S1064827594272086.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Most implementations of interior-point methods for linear programming rely on some form of elimination to solve the key equation system or systems at each iteration. Although these systems are typically very sparse, a substantial dense block often arises as the elimination proceeds. We describe a strategy that uses a serial front-end computer to carry out the sparse part of the elimination and a massively parallel processor to complete the elimination on the dense block. Through computational tests, we show that two such computers working together can solve hard linear programs much faster than either could alone. We conclude that our strategy is technically feasible now but that its components will have to be closer to the state of the art-in both serial and parallel processing-for it to be feasible in an economic sense.
Keywords:
parallel computation
linear programming
large-scale optimization
interior-point methods
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveShareSaveShareSaveShareSaveViscoelasticity, Mechanical Properties, and In Vitro Bioactivity of Gelatin/Borosilicate Bioactive Glass Nanocomposite Hydrogels as Potential Scaffolds for Bone Regeneration.png)
Polymers
OAAI
PolymersIF0
OAAIShareSave no more
no more