Share Email Print

Proceedings Paper

Implementation tricks of interior-point methods for large-scale linear programs
Author(s): Yuan Yuan
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 30 September 2011
PDF: 5 pages
Proc. SPIE 8285, International Conference on Graphic and Image Processing (ICGIP 2011), 828502 (30 September 2011); doi: 10.1117/12.913019
Show Author Affiliations
Yuan Yuan, Guangdong Univ. of Foreign Studies (China)

Published in SPIE Proceedings Vol. 8285:
International Conference on Graphic and Image Processing (ICGIP 2011)
Yi Xie; Yanjun Zheng, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?