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 strong duality is established.
منابع مشابه
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.
متن کاملGeneral Hardy-Type Inequalities with Non-conjugate Exponents
We derive whole series of new integral inequalities of the Hardy-type, with non-conjugate exponents. First, we prove and discuss two equivalent general inequa-li-ties of such type, as well as their corresponding reverse inequalities. General results are then applied to special Hardy-type kernel and power weights. Also, some estimates of weight functions and constant factors are obtained. ...
متن کامل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...
متن کاملFuzzy Linear Programming and its Application for a Constructive Proof of a Fuzzy Version of Farkas Lemma
The main aim of this paper is to deal with a fuzzy version of Farkas lemma involving trapezoidal fuzzy numbers. In turns to that the fuzzy linear programming and duality theory on these problems can be used to provide a constructive proof for Farkas lemma. Keywords Farkas Lemma, Fuzzy Linear Programming, Duality, Ranking Functions.
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Journal on Optimization
دوره 15 شماره
صفحات -
تاریخ انتشار 2005