Stable Zero Lagrange Duality for DC Conic Programming

D. H. Fang

Journal of Applied Mathematics, 2012, vol. 2012, issue 1

Abstract: We consider the problems of minimizing a DC function under a cone‐convex constraint and a set constraint. By using the infimal convolution of the conjugate functions, we present a new constraint qualification which completely characterizes the Farkas‐type lemma and the stable zero Lagrange duality gap property for DC conical programming problems in locally convex spaces.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2012/606457

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2012:y:2012:i:1:n:606457

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().