Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 135-143 |
| Number of pages | 9 |
| Journal | Mathematical Inequalities and Applications |
| Volume | 13 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Jan 2010 |
Keywords
- Conjugate dual
- Farkas-type results
- Fenchel-lagrange duality
- Finitely many convex constraints
- General composed convex optimization problems