stable zero lagrange duality for dc conic programming稳定的直流零拉格朗日对偶二次曲线编程.pdfVIP

Hindawi Publishing Corporation Journal of Applied Mathematics Volume 2012, Article ID 606457, 17 pages doi:10.1155/2012/606457 Research Article Stable Zero Lagrange Duality for DC Conic Programming D. H. Fang College of Mathematics and Statistics, Jishou University, Jishou 416000, China Correspondence should be addressed to D. H. Fang, dh fang@163.com Received 5 September 2012; Accepted 25 October 2012 Academic Editor: Abdel-Maksoud A. Soliman Copyright q 2012 D. H. Fang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 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. 1. Introduction Let X and Y be real locally convex Hausdorff topological vector spaces and C ⊆ X be a nonempty convex set. Let S ⊆ Y be a closed convex cone and S⊕ the positive dual cone of S. Let ϕ : X → R : R ∪ {∞} be a proper function and h : X → Y be an S-convex mapping with respect to the cone S. Consider the conic programming problem Min ϕ x , P 1.1 s.t. x ∈ C, h x ∈ −S. Its Lagrange dual problem can be expressed as D