Solving large-scale linear programs by interior-point methods under the Matlab ∗ Environment †
Yin Zhang · Optimization methods & software · 1998
In this paper, we describe our implementation of a primal-dual infeasible-interior-point algorithm for large-scale linear programming under the MATLAB environment. The resulting software is called LIPSOL — Linear-programming Interior-Point SOLvers. LIPSOL is designed to take the advantages of MATLAB's sparse-matrix functions and external interface facilities, and of existing Fortran sparse Cholesky codes. Under the MATLAB environment, LIPSOL inherits a high degree of simplicity and versatility in comparison to its counterparts in Fortran or C language. More importantly, our extensive computational results demonstrate that LIPSOL also attains an impressive performance comparable with that of efficient Fortran or C codes in solving large-scale problems. In addition, we discuss in detail a technique for overcoming numerical instability in Cholesky factorization at the end-stage of iterations in interior-point algorithms.
Cited by 320 works. doi:10.1080/10556789808805699
Authors
References
- A new polynomial-time algorithm for linear programming
- Iterative Solution of Nonlinear Equations in Several Variables
- Iterative Solution of Nonlinear Equations in Several Variables
- On the Implementation of a Primal-Dual Interior Point Method
- A Primal-Dual Interior Point Algorithm for Linear Programming
- Iterative solution of nonlinear equations
- Computational experience with a primal-dual interior point method for linear programming
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming