Exact penalty and error bounds in DC programming

被引:0
|
作者
Hoai An Le Thi
Tao Pham Dinh
Huynh Van Ngai
机构
[1] University of Paul Verlaine—Metz,Laboratory of Theoretical and Applied Computer Science—LITA EA 3097, UFR MIM
[2] Ile du Saulcy,Department of Mathematics
[3] LMI-National Institute for Applied Sciences-Rouen,undefined
[4] University of Quynhon,undefined
来源
关键词
DC programming; Concave programming; DCA; Subdifferential; Exact penalty; Local and global error bounds; Reformulation; 49J52; 90C20; 90C26; 90C30; 90C46;
D O I
暂无
中图分类号
学科分类号
摘要
In the present paper, we are concerned with conditions ensuring the exact penalty for nonconvex programming. Firstly, we consider problems with concave objective and constraints. Secondly, we establish various results on error bounds for systems of DC inequalities and exact penalty, with/without error bounds, in DC programming. They permit to recast several class of difficult nonconvex programs into suitable DC programs to be tackled by the efficient DCA.
引用
收藏
页码:509 / 535
页数:26
相关论文
共 50 条