An interior subgradient and a proximal linearized method for DC programming

Abstract

In this paper, we study the convergence of an interior subgradient and proximal methods for a DC (difference of convex functions) constrained minimization problem.