Abstract: The possibilities of exploiting the special structure of d. c. programs, which consist of optimizing the dierence of convex functions, are currently more or less limited to variants of the DCA proposed by Pham Dinh Tao and Le Thi Hoai An in 1997. We propose another algorithm, which allows the evaluation of both the concave and the convex part by their proximal points. Additionally, we allow a smooth part, which is evaluated via its gradient. In the spirit of primal-dual splitting algorithms, the concave part might be the composition of a concave function with a linear operator, which are, however, evaluated separately. For this algorithm we show that every cluster point is a solution of the optimization problem. Furthermore, we show the connection to the Toland dual problem and descent of the objective function values for a primal-dual formulation of the problem. Conver- gence of the iterates is shown if this objective function satises the Kurdyka-Lojasiewicz property. In the last part, we show how to apply the algorithm to real-word problems.