| Article ID: | iaor2007495 |
| Country: | Netherlands |
| Volume: | 170 |
| Issue: | 2 |
| Start Page Number: | 578 |
| End Page Number: | 596 |
| Publication Date: | Apr 2006 |
| Journal: | European Journal of Operational Research |
| Authors: | Bagirov Adil M., Yearwood John |
| Keywords: | optimization |
The minimum sum-of-squares clustering problem is formulated as a problem of nonsmooth, nonconvex optimization, and an algorithm for solving the former problem based on nonsmooth optimization techniques is developed. The issue of applying this algorithm to large data sets is discussed. Results of numerical experiments have been presented which demonstrate the effectiveness of the proposed algorithm.