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)
New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces. (English) Zbl 1142.49015
Summary: We give new regularity conditions for convex optimization problems in separated locally convex spaces. We completely characterize the stable strong and strong Fenchel-Lagrange duality. Then we give similar statements for the case when a solution of the primal problem is assumed as known, obtaining complete characterizations for the so-called total and stable total Fenchel-Lagrange duality, respectively. For particular settings the conditions that we consider turn into some constraint qualifications already used by different authors, like Farkas-Minkowski CQ, locally Farkas-Minkowski CQ and basic CQ, and we rediscover and improve some recent results from the literature.
MSC:
49N15Duality theory (optimization)
90C25Convex programming
90C34Semi-infinite programming
49N60Regularity of solutions in calculus of variations