𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Mixture decomposition via the simulated annealing algorithm

✍ Scribed by Ingrassia, S.

Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
481 KB
Volume
7
Category
Article
ISSN
8755-0024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

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.

πŸ“œ SIMILAR VOLUMES

Simulated Annealing Clusterization Algor
Simulated Annealing Clusterization Algorithm for Studying the Multifragmentation
✍ Rajeev K. Puri; Joerg Aichelin πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 370 KB

We here present the details of the numerical realization of the recently advanced algorithm developed to identify the fragmentation in heavy ion reactions. This new algorithm is based on the simulated annealing method and is dubbed the simulated annealing clusterization algorithm (SACA). We discuss

Decomposition and hybrid simulated annea
Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
✍ Christos Koulamas πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 93 KB πŸ‘ 2 views

A polynomial decomposition heuristic is developed for the parallel-machine tardiness problem (P//T V ) by extending the decomposition principle embedded in the single-machine tardiness problem (1//T V ) to a parallel-machine setting. The subproblems generated by the decomposition are solved by an ef