Heteroscedastic G-Optimal Designs

Abstract

SUMMARY This paper addresses the issue of constructing large sample G-optimal designs when the variability of the response varies across a compact design space. A useful characterization theorem is presented along with a computer algorithm for generating (heteroscedastic) G-optimal designs. to facilitate comparisons between D- and G-optimal designs, Atwood's inequality for comparing D- and G-efficiencies in homoscedastic models is generalized to heteroscedastic models. Some robustness properties of these designs are presented.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 37 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.