Duality Theorems for Separable Convex Programming Without Qualifications
详细信息 查看全文
- 作者：Satoshi Suzuki ; Daishi Kuroiwa
- 关键词：Separable convex programming ; Duality theorem ; Constraint qualification ; Generator of quasiconvex functions
- 刊名：Journal of Optimization Theory and Applications
- 出版年：2017
- 出版时间：February 2017
- 年：2017
- 卷：172
- 期：2
- 页码：669-683
- 全文大小：
- 刊物主题：Calculus of Variations and Optimal Control; Optimization; Optimization; Theory of Computation; Applications of Mathematics; Engineering, general; Operation Research/Decision Theory;
- 出版者：Springer US
- ISSN：1573-2878
- 卷排序：172
文摘
In the research of mathematical programming, duality theorems are essential and important elements. Recently, Lagrange duality theorems for separable convex programming have been studied. Tseng proves that there is no duality gap in Lagrange duality for separable convex programming without any qualifications. In other words, although the infimum value of the primal problem equals to the supremum value of the Lagrange dual problem, Lagrange multiplier does not always exist. Jeyakumar and Li prove that Lagrange multiplier always exists without any qualifications for separable sublinear programming. Furthermore, Jeyakumar and Li introduce a necessary and sufficient constraint qualification for Lagrange duality theorem for separable convex programming. However, separable convex constraints do not always satisfy the constraint qualification, that is, Lagrange duality does not always hold for separable convex programming. In this paper, we study duality theorems for separable convex programming without any qualifications. We show that a separable convex inequality system always satisfies the closed cone constraint qualification for quasiconvex programming and investigate a Lagrange-type duality theorem for separable convex programming. In addition, we introduce a duality theorem and a necessary and sufficient optimality condition for a separable convex programming problem, whose constraints do not satisfy the Slater condition.