This hybrid mixture algorithm combines the VEM algorithm for flexible support size and the EM algorithm for a fixed number of components. The solution of the VEM algorithm provides starting values for the EM algorithm. By the NPMLE theorem the EM algorithm thus starts very close to the global maximum and proper convergence of the EM algorithm to a global maximum is ensured.
The algorithm proceeds as follows
Step 1: Define an approximating grid lambda[1], ..., lambda[L]
Step 2: Use the VEM algorithm to maximize L(P) in the simplex Ω and identify grid points with positive support. Here positive support is defined as p[j] >= epsilon (often epsilon = 10^-2).
This gives an initial estimate of k.
Step 3: Use these k points and corresponding mixing weights p[j] as starting values for the EM algorithm
Step 4: Collapse identical components if | lambda[j]- lambda[i] | < delta (often delta=0.05) for i != j
Step 5: Obtain the final number of components k
This sequential algorithm leads to an initial estimate of the NPMLE and a proper solution for the subsequent EM algorithm. Crucial points are the definitions of δ and ϵ. Depending on these settings different solutions could result from this algorithm.