Find out how to access previewonly content
Application of the alternating direction method of multipliers to separable convex programming problems
 Masao Fukushima
 … show all 1 hide
Purchase on Springer.com
$39.95 / €34.95 / £29.95*
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
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.
 D.P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods, Academic Press: New York, 1982.
 D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, PrenticeHall: Englewood Cliffs, NJ, 1989.
 M. Fortin and R. Glowinski, “On decompositioncoordination methods using an augmented Lagrangian”,in M. Fortin and R. Glowinski (eds.), Augmented Lagrangian Methods: Applications to the Numerical Solution of BoundaryValue Problems, NorthHolland: Amsterdam, 1983, pp. 97–146.
 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.
 L.S. Lasdon, Optimization Theory for Large Systems, Macmillan: New York, 1970.
 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, NorthHolland: Amsterdam, 1989, pp. 529–572.
 R.T. Rockafellar, Convex Analysis, Princeton University Press: Princeton, NJ, 1970.
 R.T. Rockafellar, “Monotone operators and the proximal point algorithm,” SIAM J. on Control and Optimization, vol. 14, pp. 877–898, 1976.
 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.
 J.E. Spingarn, “Partial inverse of a monotone operator,” Appl. Math. and Optimization, vol. 10, pp. 247–265, 1983.
 J.E. Spingarn, “Applications of the method of partial inverses to convex programming: Decomposition,” Math. Programming, vol. 32, pp. 199–223, 1985.
 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.
 P. Tseng, “Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming,” Math. Programming, vol. 48, pp. 249–263, 1990.
 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.
 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.
 Title
 Application of the alternating direction method of multipliers to separable convex programming problems
 Journal

Computational Optimization and Applications
Volume 1, Issue 1 , pp 93111
 Cover Date
 19921001
 DOI
 10.1007/BF00247655
 Print ISSN
 09266003
 Online ISSN
 15732894
 Publisher
 Kluwer Academic Publishers
 Additional Links
 Topics
 Keywords

 Convex programming
 separable problems
 decomposition
 alternating direction method of multipliers
 parallel algorithm
 Industry Sectors
 Authors

 Masao Fukushima ^{(1)}
 Author Affiliations

 1. Department of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University, 606, Kyoto, Japan