mixsqp (Q45635)

From MaRDI portal
Revision as of 00:10, 22 March 2024 by Swh import (talk | contribs) (SWHID from Software Heritage)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    0 references
    0.3-48
    16 November 2022
    0 references
    0.1-79
    14 November 2018
    0 references
    0.1-97
    18 February 2019
    0 references
    0.2-2
    16 October 2019
    0 references
    0.3-17
    29 January 2020
    0 references
    0.3-43
    14 May 2020
    0 references
    0.3-54
    20 December 2023
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers