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)
Metric subregularity and constraint qualifications for convex generalized equations in Banach spaces. (English) Zbl 1190.90230
Summary: Several notions of constraint qualifications are generalized from the setting of convex inequality systems to that of convex generalized equations. This is done and investigated in terms of the coderivatives and the normal cones, and thereby we provide some characterizations for convex generalized equations to have the metric subregularity. As applications, we establish formulas of the modulus of calmness and provide several characterizations of the calmness. Extending the classical concept of extreme boundary, we introduce a notion of recession cores of closed convex sets. Using this concept, we establish global metric subregularity (i.e., error bound) results for generalized equations.
MSC:
90C31Sensitivity, stability, parametric optimization
90C25Convex programming
49J52Nonsmooth analysis (other weak concepts of optimality)
46B20Geometry and structure of normed linear spaces