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)
Constraint qualifications for extended Farkas’s lemmas and Lagrangian dualities in convex infinite programming. (English) Zbl 1206.90198
The paper is centered around the Farkas lemma and its extensions. The authors study several constraint qualifications for optimization problems with constraints given by an inequality system defined by a possibly infinite family of proper functions. Several examples of problems that recast into the form of the optimization problems above mentioned are showed in the introduction. For example, linear semi-infinite optimization problems, best approximation with restricted ranges, conic programming problems, the convex composite problem. The paper is focused on two aspects: the extended Farkas lemma and the strong Lagrangian duality. The authors use constraint qualifications involving epigraphs to provide complete characterizations for the Farkas rule and the stable Farkas rule and for the (strong/strong stable) Lagrangian duality. Several known results for the conic programming problem are extended.

90C34Semi-infinite programming
90C25Convex programming
52A07Convex sets in topological vector spaces (convex geometry)
41A29Approximation with constraints
90C46Optimality conditions, duality
Full Text: DOI