Exact Penalty Techniques in DC Programming

摘要

In the present paper, we are concerned with conditions ensuring the exact penalty for nonconvex programming. First, we consider problems with concave objective and constraints. Secondly, we establish various results on error bounds for systems of DC inequalities and exact penalty in DC programming. They permit to transform several class of difficult nonconvex programs in suitable DC programs to be tackled by the efficient DCA.