Displaying similar documents to “Coercivity properties and well-posedness in vector optimization”

New Farkas-type constraint qualifications in convex infinite programming

Nguyen Dinh, Miguel A. Goberna, Marco A. López, Ta Quang Son (2007)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

This paper provides KKT and saddle point optimality conditions, duality theorems and stability theorems for consistent convex optimization problems posed in locally convex topological vector spaces. The feasible sets of these optimization problems are formed by those elements of a given closed convex set which satisfy a (possibly infinite) convex system. Moreover, all the involved functions are assumed to be convex, lower semicontinuous and proper (but not necessarily real-valued)....

Optimality conditions for weak efficiency to vector optimization problems with composed convex functions

Radu Boţ, Ioan Hodrea, Gert Wanka (2008)

Open Mathematics

Similarity:

We consider a convex optimization problem with a vector valued function as objective function and convex cone inequality constraints. We suppose that each entry of the objective function is the composition of some convex functions. Our aim is to provide necessary and sufficient conditions for the weakly efficient solutions of this vector problem. Moreover, a multiobjective dual treatment is given and weak and strong duality assertions are proved.