Farkas–type Results for General Composed Convex Optimization Problems with Inequality Constraints
نویسندگان
چکیده
In this paper, we consider a general composed convex optimization problem with inequality systems involving a finite number of convex constraints. We establish the strong duality between the primal problem and the Fenchel-Lagrange dual problem by a conjugate duality approach. Moreover, we obtain some new Farkas-type results for this problem by using weak and strong duality theorems. Our results contain some recent results as special cases. Mathematics subject classification (2010): 90C25, 90C46, 49N15.
منابع مشابه
Farkas-type results for inequality systems with composed convex functions via conjugate duality
We present some Farkas-type results for inequality systems involving finitely many functions. Therefore we use a conjugate duality approach applied to an optimization problem with a composed convex objective function and convex inequality constraints. Some recently obtained results are rediscovered as special cases of our main result.
متن کاملCharacterizing global optimality for DC optimization problems under convex inequality constraints
Characterizations of global optimality are given for general difference convex (DC) optimization problems involving convex inequality constraints. These results are obtained in terms of E-subdifferentials of the objective and constraint functions and do not require any regularity condition. An extension of Farkas’ lemma is obtained for inequality systems involving convex functions and is used t...
متن کاملFarkas-type results for max-functions and applications
In the paper [9], Mangasarian introduced a new approach in order to give dual characterizations for different set containment problems. He succeeded to characterize the containment of a polyhedral set in another polyhedral set and in a reverse convex set defined by convex quadratic constraints and the containment of a general closed convex set in a reverse convex set defined by convex nonlinear...
متن کاملFarkas-Type Results With Conjugate Functions
Abstract. We present some new Farkas-type results for inequality systems involving a finite as well as an infinite number of convex constraints. For this, we use two kinds of conjugate dual problems, namely an extended Fenchel-type dual problem and the recently introduced FenchelLagrange dual problem. For the latter, which is a ”combination” of the classical Fenchel and Lagrange duals, the stro...
متن کاملFarkas-type results and duality for DC programs with convex constraints
In this paper, we are interested in new versions of Farkas lemmas for systems involving convex and DC-inequalities. These versions extend well-known Farkas-type results published recently, which were used as main tools in the study of convex optimization problems. The results are used to derive several strong duality results such as: Lagrange, Fenchel-Lagrange or Toland-Fenchel-Lagrange duality...
متن کامل