Farkas-type results for general composed convex optimization problems with inequality constraints

Xian Jun Long, Nan Jing Huang, Donal O'Regan

Research output: Contribution to a Journal (Peer & Non Peer)Articlepeer-review

6 Citations (Scopus)

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 languageEnglish
Pages (from-to)135-143
Number of pages9
JournalMathematical Inequalities and Applications
Volume13
Issue number1
DOIs
Publication statusPublished - Jan 2010

Keywords

  • Conjugate dual
  • Farkas-type results
  • Fenchel-lagrange duality
  • Finitely many convex constraints
  • General composed convex optimization problems

Fingerprint

Dive into the research topics of 'Farkas-type results for general composed convex optimization problems with inequality constraints'. Together they form a unique fingerprint.

Cite this