Farkas-type results and duality for DC programs with convex constraints
---Publisher, magazine: ,
Publication year: 2008
Lưu Trích dẫn Chia sẻAbstract
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 for DC and convex problems. Moreover, it is shown that for this class of problems, these versions of Farkas lemma are actually equivalent to several strong duality results of Lagrange, Fenchel-Lagrange or Toland-Fenchel-Lagrange type.
Tags: generalized Farkas lemmas; DC-programs; Toland; Fenchel; Lagrange duality; approximate normal cones
Các bài viết liên quan đến tác giả Guy Vallet
Farkas-type results and duality for DC programs with convex constraints
A closedness condition and its applications to DC programs with convex constraints
Functional inequalities and theorems of the alternative involving composite functions
A Unified Approach to Robust Farkas-Type Results with Applications to Robust Optimization Problems