Eigenvalues and constraints in mixture modeling: geometric and computational issues

This paper presents a review about the usage of eigenvalues restrictions for constrained parameter estimation in mixtures of elliptical distributions according to the likelihood approach. The restrictions serve a twofold purpose: to avoid convergence to degenerate solutions and to reduce the onset of non interesting (spurious) local maximizers, related to complex likelihood surfaces. The paper shows how the constraints may play a key role in the theory of Euclidean data clustering. The aim here is to provide a reasoned survey of the constraints and their applications, considering the contributions of many authors and spanning the literature of the last 30 years.     

Mixture decomposition via the simulated annealing algorithm

This paper presents the problem of the evaluation of the maximum likelihood estimator, when the likelihood function has multiple maxima, using the stochastic algorithm called ‘simulated annealing’. Analysis of the particular case of the decomposition of a mixture of five univariate normal distributions shows the properties of this methodology with respect to the E—M algorithm. The results are compared considering some distance measures between the estimated distribution functions and the true one.