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)
- Version0.3-54
- R version≥ 3.3.0
- LicenseMIT
- Licensefile LICENSE
- Needs compilation?Yes
- mixsqp citation info
- Last release12/20/2023
Documentation
Team
Peter Carbonetto
Youngseok Kim
Show author detailsRolesAuthorMihai Anitescu
Show author detailsRolesAuthorMatthew Stephens
Show author detailsRolesAuthorJason Willwerscheid
Show author detailsRolesContributorJean Morrison
Show author detailsRolesContributor
Insights
Last 30 days
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Depends1 package
- Imports3 packages
- Suggests3 packages
- Linking To2 packages
- Reverse Imports3 packages