New Trends in Mathematical Programming pp 203-221 | Cite as

# Ordering Heuristics in Interior Point LP Methods

## Abstract

The success of the implementation of the normal equations approach of interior point methods (IPM) for linear programming depends on the quality of its *analysis* phase, i.e. reordering for sparsity. The goal of this analysis is to find a permutation matrix *P* such that the Cholesky factor of *PAD* ^{2} *A* ^{ T } *P* ^{ T } is the sparsest possible. In practice, heuristics are used to solve this problem because finding an optimal permutation is an NP-complete problem. Two such heuristics, namely the *minimum degree* and the *minimum local fill—in* orderings are particularly useful in the context of IPM implementations. In this paper a parametric set of symbolic orderings is presented, which connects these two major approaches. It will be shown that in the “neighborhood” of the minimum degree ordering a practically efficient method exist. Implementation details will be discussed as well, and on a demonstrative set of linear programming test problems the performance of the new method will be compared with Sparspak’s GENQMD subroutine which was for a long time public accesible from NETLIB, and with the minimum local fill—in ordering implementation of CPLEX version 4.0.

## Keywords

Minimum Degree Interior Point Method Cholesky Factor Sparsity Pattern True Degree## Preview

Unable to display preview. Download preview PDF.

## References

- 1.E. D. Andersen, J. Gondzio, Cs. Mészáros and X. Xu. Implementation of interior point methods for large scale linear programming. In T. Terlaky, editor,
*Interior point methods in mathematical programming*. Kluwer Academic Publisher, 1996.Google Scholar - 2.I. S. Duff, A. M. Erisman and J. K. Reid.
*Direct methods for sparse matrices*. Oxford University Press, New York, 1986.zbMATHGoogle Scholar - 3.N. G. Esmond and B. W. Peyton. A supernodal Cholesky factorization algorithm for shared-memory multiprocessors.
*SIAM Journal on Scientific Computing*, 2 (14): 761–769, 1993.Google Scholar - 4.D. M. Gay. Electronic mail distribution of linear programming test problems.
*COAL Newsletter*, 13: 10–12, 1985.Google Scholar - 5.A. George and J. W. H. Liu.
*Computer Solution of Large Sparse Positive Definite Systems*. Prentice-Hall, Englewood Cliffs, NJ, 1981.zbMATHGoogle Scholar - 6.A. George and J. W. H. Liu. The evolution of the minimum degree ordering algorithm.
*SIAM*Rev., 31: 1–19, 1989.MathSciNetzbMATHGoogle Scholar - 7.A. George and D. R. McIntyre. On the application of the minimum degree ordering to finite elements systems.
*SIAM J. Numer. Anal.*, 15: 90–111, 1978.MathSciNetCrossRefzbMATHGoogle Scholar - 8.J. Gondzio. Multiple centrality corrections in a primal-dual method for linear programming. Technical Report 1994.20, Logilab, HEC Geneva, Section of Management Studies, University of Geneva, November 1994. Revised May 1995, to appear in Computational Optimization and Applications.Google Scholar
- 9.J. Gondzio and T. Terlaky. A computational view of interior point methods for linear programming. In J. Beasley, editor, Advances
*in linear and integer programming*. Oxford University Press, Oxford, England, 1995.Google Scholar - 10.J. W. H. Liu. Modification of the minimum-degree algorithm by multiple elimination.
*ACM Trans. Math. Software*,*11(2):141–153*,1985.Google Scholar - 11.I. J. Lustig, R. E. Marsten and D. F. Shanno. Computational experience with a primal-dual interior point method for linear programming.
*Linear Algebra Appl*., 20: 191–222, 1991.MathSciNetCrossRefGoogle Scholar - 12.I. J. Lustig, R. E. Marsten and D. F. Shanno Interior point methods for linear programming: Computational state of the art. Technical report sor 92–17, Department of Civil engineering and Operations Research, Princeton University, 1992.Google Scholar
- 13.I. J. Lustig, R. E. Marsten and D. F. Shanno Interior point methods for linear programming: Computational state of the
*art. ORSA Journal on Comput.*, 6 (1): 1–15, 1994.MathSciNetCrossRefzbMATHGoogle Scholar - 14.H. M. Markowitz. The elimination form of the inverse and its application to linear programming.
*Management Sci*., 3: 255–269, 1957.MathSciNetCrossRefzbMATHGoogle Scholar - 15.I. Maros and Cs. Mészâros. The role of the augmented system in interior point methods. Technical Report TR/06/95, Brunel University, Department of Mathematics and Statistics, London, 1995.Google Scholar
- 16.S. Mehrotra. Handling free variables in interior methods. Technical Report 91–06, Department of Industrial Engineering and Managment Sciences, Northwestern University, Evanston, USA., March 1991.Google Scholar
- 17.Cs. Mészáros. Fast Cholesky factorization for interior point methods of linear programming.
*Computers & Mathematics with Applications*, 31 (4/5): 49–54, 1996.CrossRefzbMATHGoogle Scholar - 18.E. Rothberg and A. Gupta. Efficient sparse matrix factorization on high-performance workstations–exploiting the memory hierarchy.
*ACM Trans. Math. Software*, 17 (3): 313–334, 1991.CrossRefzbMATHGoogle Scholar - 19.U. H. Suhl and L. M. Suhl. Computing sparse LU factorizations for large-scale linear programming bases.
*ORSA Journal on Comput*., 2 (4): 325–335, 1990.CrossRefzbMATHGoogle Scholar - 20.W. F. Tinney and J. W. Walker. Direct solution of sparse network equations by optimally ordered triangular factorization. In
*Proceedings of IEEE*, volume 55, pages 1801–1809. 1967.Google Scholar - 21.M. J. Todd. Exploiting special structure in Karmarkar’s linear programming algorithm.
*Mathematical Programming*, 41: 81–103, 1988.MathSciNetCrossRefGoogle Scholar - 22.M. Yannakakis. Computing the minimum fill-in is NP-complete.
*SIAM J. Algebraic Discrete Methods*, pages 77–79, 1981.Google Scholar - 23.Z. Zlatev. On some pivotal strategies in Gaussian elimimination by sparse techniques.
*SIAM Journal on Numerical Analysis*, 17 (1): 18–30, 1980.MathSciNetCrossRefzbMATHGoogle Scholar