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 (Ireland) |
|---|---|
| Number of pages | 9 |
| Journal | MATHEMATICAL INEQUALITIES & APPLICATIONS |
| Volume | 13 |
| Publication status | Published - 1 Jan 2010 |
Authors (Note for portal: view the doc link for the full list of authors)
- Authors
- Long, XJ,Huang, NJ,O'Regan, D