Partitioning mathematical programs for parallel solution

Mathematical Programming, Series B

Volumn 80, Issue 1, 1998, Pages 35-61

  Ferris, Michael C ^a   Horn, Jeffrey D ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

Bundle method; Graph partitioning; Linear programming; Parallel optimization

Indexed keywords

EID: 0040531891     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01582130     Document Type: Article

References (31)

1. W.J. Carolan, J.E. Hill, J.L. Kennington and S. Niemi and S.J. Wichmann, An empirical evaluation of the KORBX algorithms for military airlift applications, Operations Research 38 (1990) 240-248.
2. B.J. Chun, S.J. Lee and S.M. Robinson, An implementation of the bundle decomposition algorithm, Technical Report 91-6, Department of Industrial Engineering, University of Wisconsin, Madison, WI, 1991.
3. G.B. Dantzig and P. Wolfe, Decomposition principle for linear programs, Operations Research 8 (1960) 101-111.
4. I.S. Duff, A.M. Erisman and J.K. Reid, Direct Methods for Sparse Matrices (Oxford University Press, Oxford, UK, 1986).
5. M.C. Ferris and O.L. Mangasarian, Parallel constraint distribution, SIAM Journal on Optimization 1 (1991) 487-500.
6. M.C. Ferris and O.L. Mangasarian, Parallel variable distribution, SIAM Journal on Optimization 4 (1994) 815-832.
7. D.M. Gay, Electronic mail distribution of linear programming test problems, COAL Newsletter 13 (1985) 10-12.
8. G.A. Geist, A.L. Beguelin, J.J. Dongarra, W. Jiang, R. Manchek and V.S. Sunderam, PVM: Parallel Virtual Machine (MIT Press, Cambridge, MA, 1994).
9. A. George, An automatic one-way dissection algorithm for irregular finite-element problems, SIAM J. Numer. Anal. 17 (1980) 740-751.
10. J.R. Gilbert and E. Ng, Predicting structure in nonsymmetric sparse matrix factorizations, in: A. George, J. Gilbert and J. Liu, eds., Graph Theory and Sparse Matrix Computation (Springer, Berlin, 1993).
11. R.V. Helgason, J.L. Kennington and H.A. Zaki, A parallelization of the simplex method. Annals of Operations Research 14 (1988) 17-40.
12. B. Hendrickson and R. Leland, The Chaco user's guide: Version 2, Technical Report SAND94-2692, Sandia National Laboratories, Albuquerque, NM, 1994.
13. B. Hendrickson and R. Leland, A multilevel algorithm for partitioning graphs, in: Proceedings of Supercomputing '95, 1995.
14. J.K. Ho, T.C. Lee and R.P. Sundarraj, Decomposition of linear programs using parallel computation, Mathematical Programming 42 (1988) 391-405.
15. G. Karypis and V. Kumar, METIS: Unstructured graph partitioning and sparse matrix ordering system, version 2.0, Technical Report, University of Minnesota, Department of Computer Science, 1995.
16. G. Karypis and V. Kumar, Multilevel k-way partitioning scheme for irregular graphs, Technical Report 95-064, University of Minnesota, Department of Computer Science, 1995.
17. B.W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs, The Bell System Technical Journal 29 (1970) 291-307.
18. C. Lemaréchal, A. Nemirovskii and Y. Nesterov, New variants of bundle methods, Mathematical Programming 69 (1995) 111-147.
19. C. Lemaréchal, J.J. Strodiot and A. Bihain, On a bundle algorithm for nonsmooth optimization, in: O.L. Mangasarian, R.R. Meyer and S.M. Robinson, eds., Nonlinear Programming, Vol. 4 (Academic Press, New York, 1981) 245-282.
20. D. Medhi, Decomposition of structured large-scale optimization problems and parallel optimization, Ph.D. Thesis, Technical Report 718, Computer Sciences Department, University of Wisconsin, Madison, WI, 1987.
21. D. Medhi, Parallel bundle-based decomposition for large-scale structured mathematical programming problems. Annals of Operations Research 22 (1990) 101-127.
22. R. Mifflin, A stable method for solving certain constrained least squares problems, Mathematical Programming 16 (1979) 141-158.
23. J.M. Mulvey and A. Ruszczynski, A diagonal quadratic approximation methods for large scale linear programs, Operations Research Letters 12 (1992) 205-215.
24. J.L. Nazareth, Computer Solution of Linear Programs (Oxford University Press, Oxford, 1987).
25. J.K. Reid, A sparsity-exploiting variant of the Bartels-Golub decompostion for linear programming bases, Mathematical Programming 24 (1982) 55-69.
26. S.M. Robinson, Bundle-based decomposition: Description and preliminary results, in: A. Prékopa, J. Szelezcán and B. Straazicky, eds., System Modeling and Optimization, Lecture Notes in Control and Information Sciences, Vol. 84 (Springer, Berlin, 1986) 751-756.
27. S.M. Robinson, Bundle-based decomposition: Conditions for convergence, in: H. Attouch, J.P. Aubin, F. Clarke and I. Ekeland, eds., Analyse Non Linéaire (Gauthier-Villars, Paris, 1989) 435-447.
28. R.T. Rockafellar, Convex Analysis (Princeton University Press, Princeton, NJ, 1970).
29. A. Ruszczynski, On the regularized decomposition for stochastic programming problems, in: K. Marti and P. Kall, eds., Stochastic Programming: Numerical Techniques and Engineering Applications, Lecture Notes in Control and Information Sciences, Vol. 425 (Springer, Berlin, 1995) 93-108.
30. H. Schramm and J. Zowe, A version of the bundle idea for minimizing a nonsmooth function: Conceptual idea, convergence analysis, numerical results, SIAM Journal on Optimization 2 (1992) 121-152.
31. G.L. Schultz and R.R. Meyer, An interior point method for block angular optimization, SIAM Journal on Optimization 1 (1991) 583-602.