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)
A new decomposition method in nonconvex programming via a separable augmented Lagrangian. (English) Zbl 0882.65055
Gritzmann, Peter (ed.) et al., Recent advances in optimization. Proceedings of the 8th French-German conference on Optimization. Trier, Germany, July 21--26, 1996. Berlin: Springer. Lect. Notes Econ. Math. Syst. 452, 90-104 (1997).
Summary: We propose a new decomposition algorithm for separable nonlinear problems with coupling constraints and analyze its local and global convergence properties in the neighbourhood of isolated local minima in the nonconvex case. It can be seen as a separable augmented Lagrangian method based on the primal resource-directive decomposition scheme. Indeed, the primal allocations work as decoupling variables and each local allocation constraint is penalized like in the augmented Lagrangian method. We show how the alternate minimizations of the primal variables and the allocations lead to primal and dual updates which lie in orthogonal subspaces. Some limited numerical results are shown where we analyze the behaviour of the local minima of the subproblems w. r. t. parametric separable allocations. For the entire collection see [Zbl 0868.00068].

65K05Mathematical programming (numerical methods)
90C26Nonconvex programming, global optimization