.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
parallel computation
linear programming
large-scale optimization
interior-point methods
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
暂无机构信息
引用论文
分享收藏分享收藏Viscoelasticity, Mechanical Properties, and In Vitro Bioactivity of Gelatin/Borosilicate Bioactive Glass Nanocomposite Hydrogels as Potential Scaffolds for Bone Regeneration.png)
Polymers
OAAI
PolymersIF0
OAAI分享收藏 没有更多内容
没有更多内容