mixsqp
swMATH33926CRANmixsqpMaRDI QIDQ45635
Sequential Quadratic Programming for Fast Maximum-Likelihood Estimation of Mixture Proportions
Matthew Stephens, Peter Carbonetto, Youngseok Kim, Mihai Anitescu
Last update: 20 December 2023
Copyright license: MIT license, File License
Software version identifier: 0.3-48, 0.1-79, 0.1-97, 0.2-2, 0.3-17, 0.3-43, 0.3-54
Source code repository: https://github.com/cran/mixsqp
Provides an optimization method based on sequential quadratic programming (SQP) for maximum likelihood estimation of the mixture proportions in a finite mixture model where the component densities are known. The algorithm is expected to obtain solutions that are at least as accurate as the state-of-the-art MOSEK interior-point solver (called by function "KWDual" in the 'REBayes' package), and they are expected to arrive at solutions more quickly when the number of samples is large and the number of mixture components is not too large. This implements the "mix-SQP" algorithm, with some improvements, described in Y. Kim, P. Carbonetto, M. Stephens & M. Anitescu (2020) <doi:10.1080/10618600.2019.1689985>.
Related Items (3)
This page was built for software: mixsqp
