A clustering algorithm by deterministic annealing and its global convergence

The deterministic annealing (DA) is a useful approach to clustering and related optimization problems. With a view to the optimization problem, the clustering algorithm by DA is reformulated in this paper. An important global convergence theorem about this clustering algorithm has been proved.