Optimal weights for experimental designs on linearly independent support points
From MaRDI portal
Publication:806867
DOI10.1214/aos/1176348265zbMath0729.62063OpenAlexW2047187100MaRDI QIDQ806867
Friedrich Pukelsheim, Ben Torsney
Publication date: 1991
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aos/1176348265
iterative algorithmsexplicit formulageneral equivalence theoremmatrix meansA-optimal design weightsc-optimalityD- optimalityhomoscedastic variancesinformation functionslinearly independent regression vectors
Related Items (40)
Optimal Design of Experiments for Implicit Models ⋮ Towards Bayesian experimental design for nonlinear models that require a large number of sampling times ⋮ Optimal design of experiments via linear programming ⋮ Maximin efficient designs for estimating nonlinear aspects in linear models ⋮ Comparing robust properties of A, D, E and G-optimal designs ⋮ Computation of \(c\)-optimal designs for models with correlated observations ⋮ ComputingA-optimal Designs for Weighted Polynomial Regression by Taylor Expansion ⋮ A class of optimization problems on minimizing variance based criteria in respect of parameter estimators of a linear model ⋮ CDT-optimum designs for model discrimination, parameter estimation and estimation of a parametric function ⋮ V-optimal designs for heteroscedastic regression ⋮ A Review of Modern Computational Algorithms for Bayesian Optimal Design ⋮ LocallyR-optimal designs for a class of nonlinear multiple regression models ⋮ Robust and efficient design of experiments for the Monod model ⋮ Optimal designs for discriminating between dose-response models in toxicology studies ⋮ I-robust and D-robust designs on a finite design space ⋮ Adaptive grid semidefinite programming for finding optimal designs ⋮ Optimal designs for estimating individual coefficients in Fourier regression models ⋮ Compound optimal designs for percentile estimation in dose-response models with restricted design intervals ⋮ A new characterization of Elfving's method for high dimensional computation ⋮ Efficient experimental designs for sigmoidal growth models ⋮ Minimal number of support points for mini-max optimal designs ⋮ Computing \(c\)-optimal experimental designs using the simplex method of linear programming ⋮ Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs ⋮ A semidefinite programming study of the Elfving theorem ⋮ Optimal designs for a class of nonlinear regression models ⋮ Monotonic convergence of a general algorithm for computing optimal designs ⋮ Robust Linear Calibration ⋮ Local \(c\)- and \(E\)-optimal designs for exponential regression models ⋮ Support points of locally optimal designs for nonlinear models with two parameters ⋮ A-optimal designs for heteroscedastic multifactor regression models ⋮ A bidimensional class of optimality criteria involvingφpand characteristic criteria ⋮ Computing \(E\)-optimal polynomial regression designs. ⋮ On local optimality of vertex type designs in generalized linear models ⋮ Optimal Characteristic Designs for Polynomial Models ⋮ On Optimal Designs for Nonlinear Models: A General and Efficient Algorithm ⋮ Characterization of c-, L- and ϕ k-optimal Designs for a Class of Non-Linear Multiple-Regression Models ⋮ Optimal designs with respect to Elfving's partial minimax criterion for heteroscedastic polynomial regression ⋮ On optimal designs for censored data ⋮ A-Optimality Standardized Through the Coefficient of Variation ⋮ Optimal designs for a growth curve model
This page was built for publication: Optimal weights for experimental designs on linearly independent support points