activity
20082019
most citedMonotonic convergence of a general algorithm for computing optimal designs

116 citations · 590 across the 35 of their papers we have counts for

collaborators
Showing 2010Show all

7 papers · 1 filter

math.ST2010★ 12 cited

Relative log-concavity and a pair of triangle inequalities

Yaming Yu

The relative log-concavity ordering between probability mass functions (pmf's) on non-negative integers is studied. Given three pmf's that satisfy $f\l…

math.PR2010★ 5 cited

Concave Renewal Functions Do Not Imply DFR Inter-Renewal Times

Yaming Yu

Brown (1980, 1981) proved that the renewal function is concave if the inter-renewal distribution is DFR (decreasing failure rate), and conjectured the converse. This note settles B…

stat.CO2010★ 2 cited

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…

math.ST2010★ 5 cited

On the inclusion probabilities in some unequal probability sampling plans without replacement

Yaming Yu

Comparison results are obtained for the inclusion probabilities in some unequal probability sampling plans without replacement. For either successive sampling or Hájek's rejective…

stat.CO2010★ 3 cited

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…

stat.ME2010★ 16 cited

Strict Monotonicity and Convergence Rate of Titterington's Algorithm for Computing D-optimal Designs

Yaming Yu

We study a class of multiplicative algorithms introduced by Silvey et al. (1978) for computing D-optimal designs. Strict monotonicity is established for a variant considered by Tit…