Derivative free nonsmooth optimization algorithm for large data clustering

The minimum clustering problem for large data sets is formulated as a problem of nonsmooth, nonconvex optimization problem[1]. An algorithm for solving this problem is proposed by using diagonal discrete gradient bundle techniques[2]. Numerical simulation show the efficency of the current novel algorithm

Keywords:

cluster analysis , derivative free , nondifferentiable , nonsmooth optimization