116 citations · 590 across the 35 of their papers we have counts for
5 papers · 1 filter
On a Multiplicative Algorithm for Computing Bayesian D-optimal Designs
Yaming Yu
We use the minorization-maximization principle (Lange, Hunter and Yang 2000) to establish the monotonicity of a multiplicative algorithm for computing Bayesian D-optimal designs. T…
Improved EM for Mixture Proportions with Applications to Nonparametric ML Estimation for Censored Data
Yaming Yu
Improved EM strategies, based on the idea of efficient data augmentation (Meng and van Dyk 1997, 1998), are presented for ML estimation of mixture proportions. The resulting algori…
D-optimal designs via a cocktail algorithm
Yaming Yu
A fast new algorithm is proposed for numerical computation of (approximate) D-optimal designs. This "cocktail algorithm" extends the well-known vertex direction method (VDM; Fedoro…
Efficient Simulation of a Bivariate Exponential Conditionals Distribution
Yaming Yu
The bivariate distribution with exponential conditionals (BEC) is introduced by Arnold and Strauss [Bivariate distributions with exponential conditionals, J. Amer. Statist. Assoc.…
Monotonic convergence of a general algorithm for computing optimal designs
Yaming Yu
Monotonic convergence is established for a general class of multiplicative algorithms introduced by Silvey, Titterington and Torsney [Comm. Statist. Theory Methods 14 (1978) 1379--…