Skip to main content
Log in

Application of the alternating direction method of multipliers to separable convex programming problems

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

This paper presents a decomposition algorithm for solving convex programming problems with separable structure. The algorithm is obtained through application of the alternating direction method of multipliers to the dual of the convex programming problem to be solved. In particular, the algorithm reduces to the ordinary method of multipliers when the problem is regarded as nonseparable. Under the assumption that both primal and dual problems have at least one solution and the solution set of the primal problem is bounded, global convergence of the algorithm is established.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. D.P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods, Academic Press: New York, 1982.

    Google Scholar 

  2. D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Prentice-Hall: Englewood Cliffs, NJ, 1989.

    Google Scholar 

  3. M. Fortin and R. Glowinski, “On decomposition-coordination methods using an augmented Lagrangian”,in M. Fortin and R. Glowinski (eds.), Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems, North-Holland: Amsterdam, 1983, pp. 97–146.

    Google Scholar 

  4. D. Gabay and B. Mercier, “A dual algorithm for the solution of nonlinear variational problems via finite element approximation,” Comput. Math. App., vol. 2, pp. 17–40, 1976.

    Google Scholar 

  5. L.S. Lasdon, Optimization Theory for Large Systems, Macmillan: New York, 1970.

    Google Scholar 

  6. C. Lemaréchal, “Nondifferentiable optimization,” in G.L. Nemhauser, A.H.G. Rinnooy Kan and M.J. Todd (eds.), Handbooks in Operations Research and Management Science, Vol. 1, Optimization, North-Holland: Amsterdam, 1989, pp. 529–572.

    Google Scholar 

  7. R.T. Rockafellar, Convex Analysis, Princeton University Press: Princeton, NJ, 1970.

    Google Scholar 

  8. R.T. Rockafellar, “Monotone operators and the proximal point algorithm,” SIAM J. on Control and Optimization, vol. 14, pp. 877–898, 1976.

    Google Scholar 

  9. R.T. Rockafellar, “Augmented Lagrangians and applications of the proximal point algorithm in convex programming,” Math. of Oper. Res., vol. 1, pp. 97–116, 1976.

    Google Scholar 

  10. J.E. Spingarn, “Partial inverse of a monotone operator,” Appl. Math. and Optimization, vol. 10, pp. 247–265, 1983.

    Google Scholar 

  11. J.E. Spingarn, “Applications of the method of partial inverses to convex programming: Decomposition,” Math. Programming, vol. 32, pp. 199–223, 1985.

    Google Scholar 

  12. P. Tseng, “Dual ascent methods for problems with strictly convex costs and linear constraints: A unified approach,” SIAM J. on Control and Optimization, vol. 28, pp. 214–242, 1990.

    Google Scholar 

  13. P. Tseng, “Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming,” Math. Programming, vol. 48, pp. 249–263, 1990.

    Google Scholar 

  14. P. Tseng, “Applications of a splitting algorithm to decomposition in convex programming and variational inequalities,” SIAM J. on Control and Optimization, vol. 29, pp. 119–138, 1991.

    Google Scholar 

  15. R.J.B. Wets, “Convergence of convex functions, variational inequalities and convex optimization problems,” in R.W. Cottle, F. Giannessi and J.-L. Lions (eds.), Variational Inequalities and Complementarity Problems, John Wiley: Chichester, U.K., 1980, pp. 375–403.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fukushima, M. Application of the alternating direction method of multipliers to separable convex programming problems. Comput Optim Applic 1, 93–111 (1992). https://doi.org/10.1007/BF00247655

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation