On cone d.c. optimization and conjugate duality

Research output: Contribution to journalArticle

1 Citation (Scopus)


This paper derives first order necessary and sufficient conditions for unconstrained cone d.c. programming problems where the underlined space is partially ordered with respect to a cone. These conditions are given in terms of directional derivatives and subdifferentials of the component functions. Moreover, conjugate duality for cone d.c. optimization is discussed and weak duality theorem is proved in a more general partially ordered linear topological vector space (generalizing the results in [11]).

Original languageEnglish
Pages (from-to)521-528
Number of pages8
JournalChinese Annals of Mathematics. Series B
Issue number4
Publication statusPublished - 2003


All Science Journal Classification (ASJC) codes

  • Mathematics(all)
  • Applied Mathematics

Cite this