mixsqp: Sequential Quadratic Programming for Fast Maximum-Likelihood Estimation of Mixture Proportions

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>.

Package details

AuthorYoungseok Kim [aut], Peter Carbonetto [aut, cre], Mihai Anitescu [aut], Matthew Stephens [aut], Jason Willwerscheid [ctb], Jean Morrison [ctb]
MaintainerPeter Carbonetto <peter.carbonetto@gmail.com>
LicenseMIT + file LICENSE
URL https://github.com/stephenslab/mixsqp
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:

Try the mixsqp package in your browser

Any scripts or data that you put into this service are public.

mixsqp documentation built on July 1, 2020, 5:12 p.m.