We apply nonsmooth optimization techniques to classification problems, with particular reference to the TSVM (Transductive Support Vector Machine) approach, where the considered decision function is nonconvex and nondifferentiable and then difficult to minimize. We present some numerical results obtained by running the proposed method on some standard test problems drawn from the binary classification literature.