Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Sequential Farkas lemmas for convex systems

View through CrossRef
In this paper we introduce two new versions of Farkas lemma for two kinds of convex systems in locally convex Hausdorff topological vector spaces which hold without any constraint qualification conditions. These versions hold in the limits and will be called sequential Farkas lemmas. Concretely, we establish sequential Farkas lemmas for cone-convex systems and for systems which are convex with respect to a sublinear function. The first result extends some known ones in the literature while the second is a new one.
Viet Nam National University Ho Chi Minh City
Title: Sequential Farkas lemmas for convex systems
Description:
In this paper we introduce two new versions of Farkas lemma for two kinds of convex systems in locally convex Hausdorff topological vector spaces which hold without any constraint qualification conditions.
These versions hold in the limits and will be called sequential Farkas lemmas.
Concretely, we establish sequential Farkas lemmas for cone-convex systems and for systems which are convex with respect to a sublinear function.
The first result extends some known ones in the literature while the second is a new one.

Related Results

Asymptotic Farkas lemmas for convex systems
Asymptotic Farkas lemmas for convex systems
In this paper we establish characterizations of the containment of the set {xX: xC,g(x)K}{xX: f (x)0}, where C is a closed convex subset of a locally convex Hausdorff topolo...
Ostrowski-Type Fractional Integral Inequalities: A Survey
Ostrowski-Type Fractional Integral Inequalities: A Survey
This paper presents an extensive review of some recent results on fractional Ostrowski-type inequalities associated with a variety of convexities and different kinds of fractional ...
A bibliofil Farkas Lajos
A bibliofil Farkas Lajos
A Révkomáromban született, losonczi előnevet viselő Farkas Lajos (1806–1873) ügyvéd gyűjteményének egyes darabjai gyakran kerülnek a filológia és a bibliofilia érdeklődési körébe, ...
Convex hull peeling
Convex hull peeling
Enveloppes convexes pelées Cette thèse porte sur la construction du convex hull peeling (qu’on pourrait traduire littéralement par enveloppe convexe pelée). Le conv...
Decomposable Convexities in Graphs and Hypergraphs
Decomposable Convexities in Graphs and Hypergraphs
Given a connected hypergraph with vertex set V, a convexity space on is a subset of the powerset of V that contains ∅, V, and the singletons; furthermore, is closed under inter...
Convex-Fair Domination in Graphs
Convex-Fair Domination in Graphs
In this paper, we propose and investigate a novel domination parameter in graph theory, termed convex-fair domination, which integrates the principles of convex and fairdomination....
Characterization of the Propagation Route of Light Passing Through Convex Lens
Characterization of the Propagation Route of Light Passing Through Convex Lens
Abstract Existing optical theory states that the light directed to the optical center of the convex lens will travel in a straight line. Does the theory hold? If this is tr...
Efficiently Constructing Convex Approximation Sets in Multiobjective Optimization Problems
Efficiently Constructing Convex Approximation Sets in Multiobjective Optimization Problems
Convex approximation sets for multiobjective optimization problems are a well-studied relaxation of the common notion of approximation sets. Instead of approximating each image of ...

Back to Top