Lagrange-type duality in DC programming

被引:10
作者
Harada, Ryohei [1 ]
Kuroiwa, Daishi [2 ]
机构
[1] Shimane Univ, Grad Sch Sci & Engn, Matsue, Shimane, Japan
[2] Shimane Univ, Matsue, Shimane, Japan
关键词
DC programming problem; Lagrange duality theorem;
D O I
10.1016/j.jmaa.2014.04.017
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We show a Lagrange-type duality theorem for a DC programming problem, which is a generalization of previous results by J.-E. Martinez-Legaz, M. Volle [5] and Y. Fujiwara, D. Kuroiwa [1] when all constraint functions are real-valued. To the purpose, we decompose the DC programming problem into certain infinite convex programming problems. (C) 2014 Elsevier Inc. All rights reserved.
引用
收藏
页码:415 / 424
页数:10
相关论文
共 5 条
[1]   Lagrange duality in canonical DC programming [J].
Fujiwara, Yukari ;
Kuroiwa, Daishi .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 2013, 408 (02) :476-483
[2]   Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities [J].
Goberna, M. A. ;
Jeyakumar, V. ;
Lopez, M. A. .
NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 2008, 68 (05) :1184-1194
[3]   DC programming: Overview [J].
Horst, R ;
Thoai, NV .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1999, 103 (01) :1-43
[4]  
Jeyakumar V., 2004, 048 AMR U NEW S WAL
[5]   Duality in d.c. programming:: The case of several d.c. constraints [J].
Martínez-Legaz, JE ;
Volle, M .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1999, 237 (02) :657-671