Application of the alternating direction method of multipliers to separable convex programming problems
- Cite this article as:
- Fukushima, M. Comput Optim Applic (1992) 1: 93. doi:10.1007/BF00247655
- 867 Downloads
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.