Sparse matrix ordering methods for interior point linear programming

INFORMS Journal on Computing

Volumn 10, Issue 1, 1998, Pages 107-113

  Rothberg, Edward ^a   Hendrickson, Bruce ^b  

^a ILOG Inc   (United States)

^b SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

Interior point; Sparse matrix

Indexed keywords

EID: 0008954021     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.10.1.107     Document Type: Article

References (31)

1. P. AMESTOY, T. DAVIS, and I. DUFF, 1994. An Approximate Minimum Degree Ordering Algorithm, Technical report TR-94-039, University of Florida.
2. C. ASHCRAFT and J. LIU, 1994. A Partition Improvement Algorithm for Generalized Nested Dissection, Technical report BCS-TECH-94-020, Boeing Computer Services.
3. C. ASHCRAFT and J. LIU, 1996. Robust Ordering of Sparse Matrices using Multisection, Technical report ISSTECH-96-002, Boeing Information and Support Services.
4. C. ASHCRAFT and J. LIU, 1995. Using Domain Decomposition to Find Graph Bisectors, Technical report ISSTECH-95-024, Boeing Information and Support Services.
5. A. BERGER, J. MULVEY, E. ROTHBERG, and R. VANDERBEI, 1995. Solving Multistage Stochastic Programs using Tree Dissection, Technical report SOR-95-07, Dept. of Statistics and Operations Research, Princeton University.
6. R. BISSELING, T. DOUP, and L. LOYENS, 1993. A Parallel Interior Point Algorithm for Linear Programming on a Network of Transputers, Annals of Operations Research 43, 51-86.
7. T. BUI and C. JONES, 1993. A Heuristic for Reducing Fill in Sparse Matrix Factorization, 6th SIAM Conference on Parallel Processing for Scientific Computing, SIAM, Philadelphia, PA.
8. C. FIDUCCIA and R. MATTHEYSES, 1982. A Linear Time Heuristic for Improving Network Partitions in Proceedings of the 19th IEEE Design Automation Conference, 175-181.
9. D. GAY, 1985. Electronic Mail Distribution of Linear Programming Test Problems, Mathematical Programming Society (COAL) Newsletter 13, 10-12.
10. A. GEORGE and J. LIU, 1978. An Automated Nested Dissection Algorithm for Irregular Finite Element Problems, SIAM J. Numer. Anal. 15, 1053-1069.
11. A. GEORGE and J. LIU, 1981. Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, NJ.
12. A. GEORGE and J. LIU, 1989. The Evolution of the Minimum Degree Ordering Algorithm, SIAM Review 31, 1-19.
13. A. GUPTA, 1996. Graph Partitioning Based Sparse Matrix Ordering Algorithms for Interior-Point Methods, Technical report RC 20467, IBM T.J. Watson Research Center, Yorktown Heights, NY.
14. B. HENDRICKSON and R. LELAND, 1994. The Chaco User's Guide: Version 2.0, Technical report SAND94-2692, Sandia National Laboratories, Albuquerque, NM.
15. B. HENDRICKSON and R. LELAND, 1995. A Multilevel Algorithm for Partitioning Graphs, in Proceedings in Supercomputing '95, IEEE Computer Society Press, Los Alamitos, CA.
16. B. HENDRICKSON and E. ROTHBERG, 1996. Improving the Runtime and Quality of Nested Dissection Ordering, Technical report SAND96-0868J, Sandia National Laboratories, Albuquerque, NM.
17. G. KARYPIS, A. GUPTA, and V. KUMAR, 1994. A Parallel Formulation of Interior Point Algorithms, in Proceedings of Supercomputing '94, IEEE Computer Society Press, Los Alamitos, CA, 204-213.
18. G. KARYPIS and V. KUMAR, 1995. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs, Technical report 95-035, Department of Computer Science, University of Minnesota.
19. B. KERNIGHAN and S. LIN, 1978. An Efficient Heuristic Procedure for Partitioning Graphs, Bell System Technical Journal 29, 291-307.
20. J. LIU, 1989. A Graph Partitioning Algorithm by Node Separators, ACM Transactions on Mathematical Software 15, 198-219.
21. J. LIU, 1985. Modification of the Minimum Degree Algorithm by Multiple Elimination, ACM Transactions on Mathematical Software 11, 141-153.
22. I. LUSTIG, R. MARSTEN, and D. SHANNO, 1991. Computational Experience with a Primal-Dual Interior Point Method for Linear Programming, Linear Algebra and Its Applications 152, 191-222.
23. I. LUSTIG, R. MARSTEN, and D. SHANNO, 1994. Interior Point Methods for Linear Programming: Computational State of the Art, ORSA Journal on Computing 6, 1-14.
24. I. LUSTIG and E. ROTHBERG, 1996. Gigaflops in Linear Programming, OR Letters 18, 157-165.
25. H. MARKOWTTZ, 1957. The Elimination Form of the Inverse and Its Application to Linear Programming, Management Science 3, 255-269.
26. A. POTHEN and C. FAN, 1990. Computing the Block Triangular Form of a Sparse Matrix, ACM Transactions on Mathematical Software 16, 303-324.
27. A. POTHEN, E. ROTHBERG, H. SIMON, and L. WANG, 1994. Parallel Sparse Cholesky Factorization with Spectral Nested Dissection Ordering, in Proceedings of the 5th SIAM Conference on Applied Linear Algebra, SIAM, Philadelphia, PA, 418-422.
28. A. POTHEN, H. SIMON, and K. LIOU, 1990. Partitioning Sparse Matrices with Eigenvectors of Graphs, SIAM Journal of Matrix Analysis and Applications 11, 430-452.
29. A. POTHEN, H. SIMON, L. WANG, and S. BARNARD, 1992. Towards a Fast Implementation of Spectral Nested Dissection, Proceedings of Supercomputing '92, IEEE Computer Society Press, Los Alamitos, CA, 42-51.
30. E. ROTHBERG, 1996. Ordering Sparse Matrices using Approximate Minimum Local Fill, Silicon Graphics manuscript, submitted for publication.
31. W. TINNEY, 1969. Comments on using Sparsity Techniques for Power System Problems, in Sparse Matrix Proceedings, IBM Research Report RAI 3-12-69.