zbMATH — the first resource for mathematics

Examples
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.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
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)
Some reformulations and applications of the alternating direction method of multipliers. (English) Zbl 0816.90109
Hager, W. W. (ed.) et al., Large scale optimization. State of the art. Papers presented at the conference, held February 15-17, 1993 at the University of Florida, Gainesville, FL, USA. Dordrecht: Kluwer Academic Publishers. 115-134 (1994).
Summary: We consider the alternating direction method of multipliers decomposition algorithm for convex programming, as recently generalized by the first author and D. P. Bertsekas [Math. Program. 55A, No. 3, 293-318 (1992; Zbl 0765.90073)]. We give some reformulations of the algorithm, and discuss several alternative means for deriving time. We then apply these reformulations to a number of optimization problems, such as the minimum convex-cost transportation and multicommodity flow. The convex transportation version is closely related to a linear-cost transportation algorithm proposed earlier by D. P. Bertsekas and J. N. Tsitsiklis [‘Parallel and distributed computation: numerical methods’ (1989; Zbl 0743.65107)]. Finally, we construct a simple data-parallel implementation of the convex-cost transportation algorithm for the CM-5 family of parallel computers, and give computational results. The method appears to converge quite quickly on sparse quadratic-cost transportation problems, even if they are very large; for example, we solve problems with over a million arcs in roughly 100 iterations, which equates to about 30 seconds of run time on a system with 256 processing nodes. Substantially better timings can probably be achieved with a more careful implementation.
MSC:
90C25Convex programming
90B10Network models, deterministic (optimization)
65Y05Parallel computation (numerical methods)
90C08Special problems of linear programming
90C06Large-scale problems (mathematical programming)