Gigaflops in linear programming

Operations Research Letters

Volumn 18, Issue 4, 1996, Pages 157-165

  Lustig, Irvin J ^a   Rothberg, Edward ^b  

^a Building 802 279   (United States)

^b HEWLETT PACKARD ENTERPRISE   (United States)

Author keywords

Barrier methods; Interior point methods; Large scale optimization; Linear programming; Parallel

Indexed keywords

EID: 0008819771     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-6377(96)83270-6     Document Type: Article

References (23)

1. I. Adler, N.K. Karmarkar, M.G.C. Resende and G. Veiga, "An implementation of Karmarkar's algorithm for linear programming", Math. Programming 44, 297-335 (1989). Errata in Math. Programming, 50, 415 (1991).
2. P. Amestoy, T. Davis and I. Duff, "An approximate minimum degree ordering algorithm", Technical Report TR-94-039, University of Florida, Gainesvill, Fl, December 1994.
3. C. Ashcraft and R. Grimes, "The influence of relaxed supernode partitions on the multifrontal method", ACM Trans. Math. Software 15, 291-309 (1989).
4. R. Bisseling, T. Doup and L. Loyens, "A parallel interior point algorithm for linear programming on a network of transputers", Anna Oper. Res. 43, 51-86 (1993).
5. R.E. Bixby, "Implementing the simplex method: The initial basis", ORSA J. Comput. 4, 267-284 (1992).
6. J. Eckstein, R. Qi, V.I. Ragulin and S. A. Zenios, "Data-parallel implementations of dense linear programming algorithms", Technical Report TMC-230, Thinking Machines Corporation, Cambridge, MA, May 1992. Also available as Decision Sciences Department Report 92-05-06, The Wharton School, University of Pennsylvania, Philadelphia, PA.
7. D.M. Gay, "Electronic mail distribution of linear programming test problems", Math. Programming Soc. COAL Newslett. (1988).
8. G. Karypis, A. Gupta and V. Kumar, "A parallel formulation of interior point algorithms", in: Proc. Supercomputing '94, IEEE Computer Society Press, Silver Spring, MD, 1994, pp. 204-213.
9. R. Levkovitz, J.A. Andersen and G. Mitra, "The interior point method for LP on parallel computers", in: P. Kall, (ed.), System Modelling and Optimization (Proc. 15th IFIP Conf., University of Zurich, 1991), Lecture Notes in Control and Information Sciences, Vol. 180, Springer, Berlin, 1992, pp. 241-250.
10. I.J. Lustig, "An analysis of an available set of linear programming test problems", Comput. Oper. Res. 16, 173-184 (1989).
11. I.J. Lunstig, "Feasibility issues in a primal-dual interior point method for linear programming", Math. Programming 49, 145-162 (1990/91).
12. I.J. Lustig and G. Li, "An implementation of a parallel primal-dual interior point method for block-structured linear programs", Comput. Optim. Appl., 1, 141-161 (1992).
13. I.J. Lustig, R.E. Marsten and D.F. Shanno, "The primal-dual interior point method on the Cray supercomputer", in: T.F. Coleman and Y. Li (eds.), Large-Scale Numerical Optimization, Papers from the Workshop held at Cornell University, Ithaca, NY, USA, October 1989, SIAM Proc. in Applied Mathematics, Vol 46, Society of Industrial and Applied Mathematics (SIAM), Philadelphia, PA (1990) pp. 70-80.
14. 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. 152, 191-222 (1991).
15. I.J. Lustig, R.E. Marsten and D.F. Shanno, "Interior method vs. simplex method: Beyond netlib", COAL Newslett. 19, 41-44 (1991).
16. I.J. Lustig, R.E. Marsten and D.F. Shanno, "On implementing Mehrotva's predictor-corrector interior point method for linear programming", SIAM J. Optim. 2, 435-449 (1992).
17. I.J. Lustig, R.E. Marsten and D.F. Shanno, "Interior point methods for linear programming: computational state of the art", ORSA J. Comput., 6, 1-14 (1994).
18. S. Mehrotra, "On the implementation of a primal-dual interior point method", SIAM J. Optim. 2, 575-601 (1992).
19. M.G.C. Resende and G. Veiga, "An implementation of the dual affine scaling algorithm for minimum-cost flow on bipartite uncapicitated networks", SIAM J. Optim. 3, 516-537 (1993).
20. E. Rothberg, "Alternatives for solving sparse triangular systems of equations", Parallel Comput., to appear.
21. E. Rothberg, A. Gupta, E. Ng and B. Peyton, "Parallel sparse Cholesky factorization algorithms for shared-memory multiprocessor systems", in: Proc. 7th IMACS Internat. Conf. on Computer Methods for Partial Differential Equations (1992).
22. Silicon Graphics, Inc., Power C User's Guide.
23. A. Vannelli, "A parallel implementation of an interior point method for linear programming", in: Parallel Processing for Scientific Computing (Houston, TX), 1991, SIAM, Philadelphia (1992) pp. 163-167.