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)
Alternating direction method with Gaussian back substitution for separable convex programming. (English) Zbl 1273.90152
The Douglas-Rachford alternating direction method of multipliers has been well studied for solving linearly constrained separable convex minimization problems whose objective function is separated into two individual convex functions with nonoverlapping variables. The case of more than two convex functions is still open. By combining a Douglas-Rachford alternating direction method of multipliers with a Gaussian back substitution procedure, this paper develops an efficient method for solving the linearly constrained separable convex minimization problem whose objective function is separated into m (m3) individual functions with nonoverlapping variables. The convergence of the new method is proven via the analytic framework of contractive-type methods and its efficiency is shown for solving some concrete applications arising in various disciplines.
MSC:
90C25Convex programming
65K05Mathematical programming (numerical methods)
94A08Image processing (compression, reconstruction, etc.)