In this paper, a (local) calmness condition of order α is introduced for a general vector optimization problem with cone constraints in infinite dimensional spaces. It is shown that the (local) calmness is equivalent to the (local) exact penalization of a vector-valued penalty function for the constrained vector optimization problem. Several necessary and sufficient conditions for the local calmness of order α are established. Finally, it is shown that the local calmness of order 1 implies the existence of normal Lagrange multipliers.Department of Applied Mathematic
In this paper the notion of Strict Benson proper-ε-efficient solution for a vector optimization p...
We derive conditions for Hoelder calmness of minimal points of a given set, as a function of a param...
The aim of this note is to show that recent results concerning regularity conditions and constraint ...
We establish necessary and sufficient dual conditions for weak and proper minimality of infinite dim...
By exploiting very recent results concerning linear separation between a set and a convex cone, the ...
The authors analyze the sensitivity of optimal values and optimal sets of finite dimensional optimiz...
We consider the problem of finding the set of proper minimal (proper efficient, proper Pareto optima...
In this paper the constrained vector optimization problem min Cf(x), g(x) ∈ - K, is considered, wher...
We present the local sensitivity analysis for cone-constrained optimization problems under the CQ-ty...
We consider bilevel programs such that their lower level problem is linear with respect to the lower...
AbstractIn this note, a general cone separation theorem between two subsets of image space is presen...
In this paper, we first establish characterizations of the nonemptiness and compactness of the set o...
AbstractWe consider the constrained vector optimization problem minCf(x), x∈A, where X and Y are nor...
Convex vector (or multi-objective) semi-infinite optimization deals with the simultaneous minimizati...
We consider the constrained vector optimization problem min(C) f (x), x is an element of A, where X ...
In this paper the notion of Strict Benson proper-ε-efficient solution for a vector optimization p...
We derive conditions for Hoelder calmness of minimal points of a given set, as a function of a param...
The aim of this note is to show that recent results concerning regularity conditions and constraint ...
We establish necessary and sufficient dual conditions for weak and proper minimality of infinite dim...
By exploiting very recent results concerning linear separation between a set and a convex cone, the ...
The authors analyze the sensitivity of optimal values and optimal sets of finite dimensional optimiz...
We consider the problem of finding the set of proper minimal (proper efficient, proper Pareto optima...
In this paper the constrained vector optimization problem min Cf(x), g(x) ∈ - K, is considered, wher...
We present the local sensitivity analysis for cone-constrained optimization problems under the CQ-ty...
We consider bilevel programs such that their lower level problem is linear with respect to the lower...
AbstractIn this note, a general cone separation theorem between two subsets of image space is presen...
In this paper, we first establish characterizations of the nonemptiness and compactness of the set o...
AbstractWe consider the constrained vector optimization problem minCf(x), x∈A, where X and Y are nor...
Convex vector (or multi-objective) semi-infinite optimization deals with the simultaneous minimizati...
We consider the constrained vector optimization problem min(C) f (x), x is an element of A, where X ...
In this paper the notion of Strict Benson proper-ε-efficient solution for a vector optimization p...
We derive conditions for Hoelder calmness of minimal points of a given set, as a function of a param...
The aim of this note is to show that recent results concerning regularity conditions and constraint ...