Annals of Operations Research

, Volume 22, Issue 1, pp 101–127 | Cite as

Parallel bundle-based decomposition for large-scale structured mathematical programming problems

  • Deepankar Medhi


In this paper, we present parallel bundle-based decomposition algorithms to solve a class of structured large-scale convex optimization problems. An example in this class of problems is the block-angular linear programming problem. By dualizing, we transform the original problem to an unconstrained nonsmooth concave optimization problem which is in turn solved by using a modified bundle method. Further, this dual problem consists of a collection of smaller independent subproblems which give rise to the parallel algorithms. We discuss the implementation on the CRYSTAL multi-computer. Finally, we present computational experience with block-angular linear programming problems and observe that more than 70% efficiency can be obtained using up to eleven processors for one group of test problems, and more than 60% efficiency can be obtained for relatively smaller problems using up to five processors for another group of problems.


Programming Problem Test Problem Mathematical Programming Computational Experience Parallel Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    E.G. Coffman, M.R. Garey and D.S. Johnson, An application of bin packing to multi-processor scheduling, SIAM J. Computing 7(1978)1–17.CrossRefGoogle Scholar
  2. [2]
    G.B. Dantzig and P. Wolfe, The decomposition algorithm for linear programs, Econometrica 29(1961)767–778.Google Scholar
  3. [3]
    D.J. DeWitt, R. Finkel and M. Solomon, The CRYSTAL multicomputer: Design and implementation experience, Technical Report No. 553, Computer Sciences Department, University of Wisconsin-Madison (Sept. 1984).Google Scholar
  4. [4]
    M.R. Garey, R.L. Graham and D.S. Johnson, Performance guarantees for scheduling algorithms, Oper. Res. 26(1978)3–21.CrossRefGoogle Scholar
  5. [5]
    R.L. Graham, Bounds on multiprocessing timing anomalies, SIAM J. Appl. Math. 17(1969)416–429.CrossRefGoogle Scholar
  6. [6]
    J.K. Ho and E. Loute, DECOMP user's guide, unpublished manuscript.Google Scholar
  7. [7]
    J.K. Ho and E. Loute, An advanced implementation of the Dantzig-Wolfe decomposition algorithm for linear programming, Math. Progr. 20(1981)303–326.CrossRefGoogle Scholar
  8. [8]
    IMSL User's Manual, edition 9.2 (International Mathematical and Statistical Library, Houston, TX, Nov. 1984).Google Scholar
  9. [9]
    C. Lemaréchal, A view of line searches, in:Nonsmooth Optimization, ed. C. Lemaréchal and R. Mifflin (Pergamon Press, Oxford, 1978) pp. 59–78.Google Scholar
  10. [10]
    C. Lemaréchal, J.J. Strodiot and A. Bihain, On a bundle algorithm for nonsmooth optimization, in:Nonlinear Programming 4, ed. O.L. Mangasarian, R.R. Meyer and S.M. Robinson (Academic Press, 1981) pp.245–282.Google Scholar
  11. [11]
    C. Lemaréchal and M.-C. Bancora Imbert, Le module M1FC1, Preprint INRIA, B.P. 105, Le Chesnay, France (March 1985).Google Scholar
  12. [12]
    D. Medhi, Decomposition of structured large-scale optimization problems and parallel optimization, Ph.D. Dissertation, Technical Report No. 718, Computer Sciences Department, University of Wisconsin-Madison (Sept. 1987).Google Scholar
  13. [13]
    D. Medhi, Bundle-based decomposition for structured large-scale convex optimization problems: Error estimate and application to block-angular linear programs, submitted for publication (1988).Google Scholar
  14. [14]
    R. Mifflin, A stable method for solving certain constrained least-squares problems, Math. Progr. 16(1979)141–158.CrossRefGoogle Scholar
  15. [15]
    B.A. Murtagh and M.A. Sauders, MINOS 5.0 user's guide, Technical Report No. SOL 83-20, System Optimization Laboratory, Department of Operations Research, Stanford University (Dec. 1983).Google Scholar
  16. [16]
    S.M. Robinson, Bundle-based decomposition: Description and preliminary results, in:System Modelling and Optimization, ed. A. Prékopa, J. Szeleszán and B. Strazicky, Lecture Notes in Control and Information Sciences, Vol. 84 (Springer-Verlag, Berlin, 1986) pp. 751–756.Google Scholar
  17. [17]
    R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, 1970).Google Scholar
  18. [18]
    R.T. Rockafellar,Conjugate Duality and Optimization (SIAM, Philadelphia, 1974).Google Scholar

Copyright information

© J.C. Baltzer AG, Scientific Publishing Company 1990

Authors and Affiliations

  • Deepankar Medhi
    • 1
  1. 1.Computer Science Telecommunications ProgramUniversity of Missouri-Kansas CityKansas CityUSA

Personalised recommendations