Solving large-scale linear programs by interior-point methods under the MATLAB environment

Optimization Methods and Software

Volumn 10, Issue 1, 1998, Pages 1-31

  Zhang, Yin ^a  

^a RICE UNIVERSITY   (United States)

Author keywords

Interior point algorithms; Linear programming; LIPSOL; MATLAB

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); COMPUTER SOFTWARE; FORTRAN (PROGRAMMING LANGUAGE); INTERFACES (COMPUTER); ITERATIVE METHODS; MATRIX ALGEBRA; RESPONSE TIME (COMPUTER SYSTEMS);

INTERIOR POINT ALGORITHMS; SOFTWARE PACKAGE LIPSOL; SOFTWARE PACKAGE MATLAB;

LINEAR PROGRAMMING;

EID: 0032303559     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556789808805699     Document Type: Article

References (21)

1. Andersen, E. D., Gondzio, J., Mészáros, C., and Xu, X. (1996). Implementation of interior-point methods for large-scale linear programming. Technical Report 1996.3, Logilab, HEC Geneva, Section of Management Studies, University of Geneva, Switzerland.
2. Choi, I. C., Monma, C. L. and Shanno, D. F. (1990). Further development of a primal-dual interior-point method. ORSA J. on Computing, 2, 304-311.
3. Gay, D. M. Electronic mail distribution of linear programming test problems. Mathematical Programming Society COAL Newsletter, (13), (Dec., 1985), 10-12.
4. Gondzio, J. Multiple centrality corrections in a primal-dual method for linear programming. Computational Optimization and Applications. To appear.
5. Karmarkar, N. (1984). A New Polynomial-time Algorithm for Linear Programming. Combinatorica, 4, 373-395.
6. Kojima, M., Mizuno, S. and Yoshise, A. (1989). A primal-dual interior point method for linear programming. In Nimrod Megiddo, editor, Progress in mathematical programming, interior-point and related methods, Springer-Verlag, New York, pages 29-47.
7. Kojima, M., Megiddo, N. and Mizuno, S. (1993). A primal-dual infeasible-interior-point algorithm for linear programming. Mathematical Programming, 61, pp. 263-280.
8. Liu, J. W., Ng, E. G. and Peyton, B. W. (1993). On finding supernodes for sparse matrix computations. SIAM J. Matrix Anal. and Appl., 1, 242-252.
9. Lustig, I. J., Marsten, R. E. and Shanno, D. F. (1991). Computational experience with a primal-dual interior point method for linear programming. Linear Algebra and Its Applications, 152, 191-222.
10. Lustig, I. J., Marsten, R. E. and Shanno, D. F. (1992). On implementing Mehrotra's predictor-corrector interior point method for linear programming. SIAM J. Optimization, 2, 435-449.
11. Lustig, I. J., Marsten, R. E. and Shanno, D. F. (1994). Interior point methods for linear programming: Computational state of the art. ORSA J. on Computing, 6, 1-14.
12. Lustig, I. J. Barrier algorithms for linear programming. Workshop on Computational Linear and Integer Programming, Fifth INFORMS Computer Science Technical Section Conference, Jan. 7-10, 1996, Dallas, Texas, USA.
13. Mehrotra, S. (1992). On the implementation of a primal-dual interior point method. SIAM J. Optimization, 2, 575-601.
14. Mizuno, S., Todd, M. J. and Ye, Y. (1993). On adaptive step primal-dual interior-point algorithms for linear programming. Mathematics of Operations Research, 18, 964-981.
15. Nazareth, L. L. (1987). Computer Solution of Linear Programs, Chapter 3. Oxford University Press, New York, Oxford.
16. Ortega, J. M. and Rheinboldt, W. C. (1970). Iterative Solution of Nonlinear Equations in Several Variables., Academic Press, New York.
17. Tapia, R. A., Zhang, Y., Saltzman, M. and Weiser, A. (1996). The predictor-corrector interior-point method as a composite Newton method. SIAM J. Optimization, 6, to appear.
18. Xu, X., Hung, P. F. and Ye, Y. (1993). A simplified homogeneous and self-dual linear programming algorithm. Technical Report, Dept. of Management Science, University of Iowa, Iowa City, Iowa.
19. Zhang, Y. (1994). On the convergence of a class of infeasible interior-point algorithms for the horizontal linear complementarity problem. SIAM J. Optimization, 4, 208-227.
20. Zhang, Y. (1995). User's Guide to LIPSOL. Technical Report TR95-19, Dept. of Mathematics and Statistics, University of Maryland Baltimore County, Baltimore, MD 21228.
21. Zhang, Y. and Zhang, D. (1995). On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms. Mathematical Programming, 68, 303-318.