Skip to main content
Log in

Alternating direction splitting for block Angular parallel optimization

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

We develop and compare three decomposition algorithms derived from the method of alternating directions. They may be viewed as block Gauss-Seidel variants of augmented Lagrangian approaches that take advantage of block angular structure. From a parallel computation viewpoint, they are ideally suited to a data parallel environment. Numerical results for large-scale multicommodity flow problems are presented to demonstrate the effectiveness of these decomposition algorithmims on the Thinking Machines CM-5 parallel supercomputer relative to the widely-used serial optimization package MINOS 5.4.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Lions, P., andMercier, B.,Splitting Altorthms for the Sum of Two Nonlinear Operators, SIAM Journal on Numerical Analysis, Vol. 16, pp. 964–979, 1979.

    Google Scholar 

  2. Dantzig, G., andWolfe, P.,Decomposition Principle for Linear Programs, Operations Research, Vol. 8, pp. 101–111, 1960.

    Google Scholar 

  3. Schultz, G., andMeyer, R.,An Interior-Point Method for Block Angular Optimization, SIAM Journal on Optimzation, Vol. 1, pp. 583–602, 1991.

    Google Scholar 

  4. Ferris, M., andMangasarian, O.,Parallel Variable Distribution, SIAM Journal on Optimization, Vol. 4, pp. 815–832, 1994.

    Google Scholar 

  5. Mulvey, J., andRusczyński, A.,A Diagonal Quadratic Approximation Method for Large-Scale Linear Programs, Operations Research Letters, Vol. 12, pp. 205–215, 1992.

    Google Scholar 

  6. De Leone, R., Meyer, R. R., Kontogiorgis, S., Zakarian, A., andZakeri, G.,Coordination Methods in Coarse-Grained Decomposition, SIAM Journal on Optimization, Vol. 4, pp. 777–793, 1994.

    Google Scholar 

  7. Kontogiorgis, S.,Alternating Directions Methods for the Parallel Solution of Large-Scale Block-Structured Optimization Problems, PhD Thesis, Department of Computer Sciences, University of Wisconsin-Madison, 1994.

  8. Fortin, M., andGlowinski, R., Editors,Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Valued Problems, North Holand, Amsterdam, Holland, 1983.

    Google Scholar 

  9. Eckstein, J., andBertsekas, D.,On the Douglas-Rachford Splitting Method and the Proximal-Point Method for Maximal Monotone Operators, Mathematical Programming, Vol. 55A, pp. 293–318, 1992.

    Google Scholar 

  10. Douglas, J., andRachford, Jr., H.,On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables, Transactions of the American Mathematical Society, Vol. 82, pp. 421–439, 1956.

    Google Scholar 

  11. Rockafellar, R., andWets, R. J. B.,Scenarios and Policy Aggregation in Optimization under Uncertainty, Mathematics of Operations Research, Vol. 16, pp. 119–147, 1991.

    Google Scholar 

  12. Bertsekas, D., andTsitsiklis, J.,Parallel and Distributed Computation: Numerical Methods, Prentice Hall, Englewood Cliffs, New Jersey, 1989.

    Google Scholar 

  13. De Leone, R., andMangasarian, O.,Asynchronous Parallel Successive Overrelaxation for the Symmetric Linear Complementarity Problem, Mathematical Programming, Vol. 42B, pp. 347–362, 1988.

    Google Scholar 

  14. Thinking Machines Corporation,The Connection Machine CM-5 Technical Summary, Cambridge, Massachusetts, 1991.

  15. Ali, A., andKennington, J.,MnETGEN Program Docummentation, Report IEOR 77003, Department of Industrial Engineering and Opeartions Research, Southern Methodist University, Dallas, Texas, 1977.

    Google Scholar 

  16. Murtagh, B., andSaunders, M.,MINOS 5.4 Release Notes: Appendix to MINOS 5.1 User's Guide, Report SOL 83.20R-1987, Stanford University, Stanford, California, 1992.

    Google Scholar 

  17. Miele, A., Moseley, P., Levy, A., andCoggins, G.,On the Method of Multipliers for Mathematical Programming Problems, Journal of Optimization Theory and Applications, Vol. 10, pp. 1–33, 1972.

    Google Scholar 

  18. Eckstein, J.,The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2, ORSA Journal on Computing, Vol. 5, pp. 293–318, 1993.

    Google Scholar 

  19. Fukushima, M.,Application of the Alternating Direction Method of Multipliers to Separable Convex Programming Problems, Computational Optimization and Applications, Vol. 1, pp. 93–111, 1992.

    Google Scholar 

  20. Mulvey, J., andVladimirou, H.,Solving Multistage Stochastic Networks: An Application of Scenario Aggregation, Networks, Vol. 21, pp. 619–643, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by O. L. Mangasarian

This material is based on research supported by the Air Force Office of Scientific Research, Grants AFORS-89-0410 and F49620-1-0036, and by NSF Grants CCR-89-07671, CDA-90-24618, and CCR-93-06807. The work of the second author was supported partially by Grant 95.00732.CT01 from the Italian National Research Council (CNR).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kontogiorgis, S., De Leone, R. & Meyer, R.R. Alternating direction splitting for block Angular parallel optimization. J Optim Theory Appl 90, 1–29 (1996). https://doi.org/10.1007/BF02192243

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02192243

Key Words

Navigation