zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Application of the alternating direction method of multipliers to separable convex programming problems. (English) Zbl 0763.90071
Summary: 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.
90C25Convex programming
90-08Computational methods (optimization)
65Y05Parallel computation (numerical methods)
49M27Decomposition methods in calculus of variations
[1]D.P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods, Academic Press: New York, 1982.
[2]D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Prentice-Hall: Englewood Cliffs, NJ, 1989.
[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.
[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. · Zbl 0352.65034 · doi:10.1016/0898-1221(76)90003-1
[5]L.S. Lasdon, Optimization Theory for Large Systems, Macmillan: New York, 1970.
[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.
[7]R.T. Rockafellar, Convex Analysis, Princeton University Press: Princeton, NJ, 1970.
[8]R.T. Rockafellar, ”Monotone operators and the proximal point algorithm,” SIAM J. on Control and Optimization, vol. 14, pp. 877–898, 1976. · Zbl 0358.90053 · doi:10.1137/0314056
[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. · Zbl 0402.90076 · doi:10.1287/moor.1.2.97
[10]J.E. Spingarn, ”Partial inverse of a monotone operator,” Appl. Math. and Optimization, vol. 10, pp. 247–265, 1983. · Zbl 0524.90072 · doi:10.1007/BF01448388
[11]J.E. Spingarn, ”Applications of the method of partial inverses to convex programming: Decomposition,” Math. Programming, vol. 32, pp. 199–223, 1985. · Zbl 0565.90058 · doi:10.1007/BF01586091
[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. · Zbl 0692.49025 · doi:10.1137/0328011
[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. · Zbl 0725.90079 · doi:10.1007/BF01582258
[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. · Zbl 0737.90048 · doi:10.1137/0329006
[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.