Beyond the EM algorithm: constrained optimization methods for latent class model
From MaRDI portal
Cites work
- A globally convergent method for nonlinear programming
- Constructing Confidence Sets Using Rank Statistics
- scientific article; zbMATH DE number 4055377 (Why is no real title available?)
- scientific article; zbMATH DE number 4104359 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 1086058 (Why is no real title available?)
- scientific article; zbMATH DE number 1832191 (Why is no real title available?)
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On the convergence properties of the EM algorithm
- Randomized quasi-Newton updates are linearly convergent matrix inversion algorithms
- Representations of quasi-Newton matrices and their use in limited memory methods
Cited in
(4)
This page was built for publication: Beyond the EM algorithm: constrained optimization methods for latent class model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5042122)