mixsqp (Q45635): Difference between revisions
From MaRDI portal
Created claim: source code repository (P339): https://github.com/cran/mixsqp, #quickstatements; #temporary_batch_1711029738451 |
Swh import (talk | contribs) SWHID from Software Heritage |
||||||||||||||
| Property / Software Heritage ID | |||||||||||||||
| Property / Software Heritage ID: swh:1:snp:110c0672774bffa892fc0732a402cabcdf3dd365 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / Software Heritage ID: swh:1:snp:110c0672774bffa892fc0732a402cabcdf3dd365 / qualifier | |||||||||||||||
| Property / Software Heritage ID: swh:1:snp:110c0672774bffa892fc0732a402cabcdf3dd365 / qualifier | |||||||||||||||
point in time: 4 January 2024
| |||||||||||||||
Latest revision as of 00:10, 22 March 2024
Sequential Quadratic Programming for Fast Maximum-Likelihood Estimation of Mixture Proportions
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | mixsqp |
Sequential Quadratic Programming for Fast Maximum-Likelihood Estimation of Mixture Proportions |
Statements
20 December 2023
0 references
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>.
0 references
