Paper
30 September 2011 Implementation tricks of interior-point methods for large-scale linear programs
Yuan Yuan
Author Affiliations +
Proceedings Volume 8285, International Conference on Graphic and Image Processing (ICGIP 2011); 828502 (2011) https://doi.org/10.1117/12.913019
Event: 2011 International Conference on Graphic and Image Processing, 2011, Cairo, Egypt
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.
© (2011) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yuan Yuan "Implementation tricks of interior-point methods for large-scale linear programs", Proc. SPIE 8285, International Conference on Graphic and Image Processing (ICGIP 2011), 828502 (30 September 2011); https://doi.org/10.1117/12.913019
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Computer programming

Chemical elements

Radon

Scientific programming

Algorithms

Bismuth

Matrices

RELATED CONTENT

Reconfigurating feedforward networks with fewer hidden nodes
Proceedings of SPIE (September 01 1993)
Lie EM ICP algorithm a novel frame for 2D...
Proceedings of SPIE (November 19 2012)
Dantzig selector homotopy with dynamic measurements
Proceedings of SPIE (February 02 2009)
Solution space analysis of manufacturing scheduling problems
Proceedings of SPIE (November 11 2004)
Accurate fast Hankel matrix solver
Proceedings of SPIE (December 01 1991)
Fast recursive-least-squares algorithms for Toeplitz matrices
Proceedings of SPIE (December 01 1991)

Back to Top