2014
DOI: 10.1137/120901805
|View full text |Cite
|
Sign up to set email alerts
|

From the Farkas Lemma to the Hahn--Banach Theorem

Abstract: Abstract. This paper provides new versions of the Farkas lemma characterizing those inequalities of the form f (x) ≥ 0 which are consequences of a composite convex inequality (S • g)(x) ≤ 0 on a closed convex subset of a given locally convex topological vector space X, where f is a proper lower semicontinuous convex function defined on X, S is an extended sublinear function, and g is a vector-valued S-convex function. In parallel, associated versions of a stable Farkas lemma, considering arbitrary linear pertu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

2
13
0

Year Published

2015
2015
2018
2018

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 16 publications
(15 citation statements)
references
References 13 publications
2
13
0
Order By: Relevance
“…In the rest of this section we consider some special cases where the results above collapse to several well-known asymptotic Farkas-type results in the literature ( [6], [9]). These results have been used to get optimality conditions, duality theorems, and set containment characterizations for (SOP).…”
Section: Let Us Considersupporting
confidence: 57%
See 4 more Smart Citations
“…In the rest of this section we consider some special cases where the results above collapse to several well-known asymptotic Farkas-type results in the literature ( [6], [9]). These results have been used to get optimality conditions, duality theorems, and set containment characterizations for (SOP).…”
Section: Let Us Considersupporting
confidence: 57%
“…The next stable Farkas lemma for convex systems under linear perturbations [6] is a direct consequence of the previous results. [6] Let (f; g; C) be a scalar triple such that f 2 (X), the convex cone S is closed, and g is S-convex and S-epi closed.…”
Section: Corollary 35 (Asymptotic Convex Farkas Lemma)mentioning
confidence: 55%
See 3 more Smart Citations