Title: Implementation tricks of interior-point methods for large-scale linear programs
Abstract: The modern era of interior-point methods (IPM) dates to 1984, when Karmarkar proposed his algorithm for linear programming. In the years since then, interior-point algorithm and software for linear problems have become quite sophisticated and gained extraordinary interest as an alternative to the sparse simplex based methods. In this paper, we introduce the infeasible primal-dual algorithm which is widely considered the most efficient general purpose IPM. Then many issues that are crucial for the efficient implementation of an interior-point algorithm are addressed in detail. To facilitate the understanding of different implementation strategies, some illustrative numerical results on a subset of problems from the Netlib collection are presented.
Publication Year: 2011
Publication Date: 2011-10-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 4
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot