Fenchel-Lagrange duality for DC infinite programs with inequality constraints

被引：5
|
作者：
Li, Gang [1 ]
Xu, Yinghong [1 ]
Qin, Zhenhua [2 ]
机构：
[1] Zhejiang Sci Tech Univ, Dept Math, Hangzhou 310018, Peoples R China
[2] Zhejiang Inst Mech & Elect Engn, Dept Informat Technol, Hangzhou 310053, Peoples R China
来源：
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS | 2021年 / 391卷
关键词：
DC optimization problem; Fenchel-Lagrange duality; Epigraph; Conic programming;
D O I：
10.1016/j.cam.2021.113426
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper, we consider a composite DC optimization problem with constraints described by an arbitrary (possibly infinite) number of DC inequalities. By using the properties of the epigraph of the conjugate functions, we introduce some new constraint qualifications, which completely characterize the weak (zero/strong/stable) Fenchel- Lagrange duality between the primal problem and its dual problem. As applications, we obtain the corresponding results for a conic programming problem with DC composite function, a DC infinite programming problem with inequality constraints, and a DC optimization problem with composite functions, respectively. (c) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页数：16
相关论文
共 50 条
12345