.png){kind=icon}
返回
Implementation of an interior point method with basis preconditioning
.png){kind=icon}
OA
AI
DOI：10.1007/s12532-020-00181-8.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The implementation of a linear programming interior point solver is described that is based on iterative linear algebra. The linear systems are preconditioned by a basis matrix, which is updated from one interior point iteration to the next to bound the entries in a certain tableau matrix. The update scheme is based on simplex-type pivot operations and is implemented using linear algebra techniques from the revised simplex method. An initial basis is constructed by a crash procedure after a few interior point iterations. The basis at the end of the interior point solve provides the starting basis for a crossover method which recovers a basic solution to the linear program. Results of a computational study on a diverse set of medium to large-scale problems are discussed.
Keyword:
Linear programming
Interior point methods
Basis preconditioning
Crossover
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
198
被引数:
1.9K
机构
引用论文
.png){kind=icon}
Dynamical Cluster Approximation in Disordered Systems with Magnetic Impurities具有磁性杂质的无序系统中的动力学簇近似
PREAI
分享收藏
查看更多内容