JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, cilt.259, ss.851-867, 2014 (SCI İndekslerine Giren Dergi)
A new algorithm is developed based on the concept of codifferential for minimizing the difference of convex nonsmooth functions. Since the computation of the whole codifferential is not always possible, we use a fixed number of elements from the codifferential to compute the search directions. The convergence of the proposed algorithm is proved. The efficiency of the algorithm is demonstrated by comparing it with the subgradient, the truncated codifferential and the proximal bundle methods using nonsmooth optimization test problems. (C) 2013 Elsevier B.V. All rights reserved.