scientific article; zbMATH DE number 472979
From MaRDI portal
Publication:4272843
zbMath0794.62043MaRDI QIDQ4272843
Publication date: 2 January 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
information matrixheteroscedasticitycharacterization theoremcomputer algorithmdesign efficiencyheteroscedastic models\(D\)-optimalAtwood's inequalitycompact design spaceconstructing large sample \(G\)-optimal designslarge sample designrobustess properties
Related Items
\(G\)-optimal designs for multi-factor experiments with heteroscedastic errors, Optimal designs for comparing curves, On the equivalence of D and G-optimal designs in heteroscedastic models, An algorithmic construction of optimal minimax designs for heteroscedastic linear models, Minimax \(D\)-optimal designs for item response theory models, Minimal number of support points for mini-max optimal designs, Discussion: A general approach to \(D\)-optimal designs for weighted univariate polynomial regression models, A geometric characterization of \(c\)-optimal designs for heteroscedastic regression, A minimax algorithm for constructing optimal symmetrical balanced designs for a logistic regression model, \(G\)-optimal designs for hierarchical linear models: an equivalence theorem and a nature-inspired meta-heuristic algorithm, A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models, Minimax optimal designs via particle swarm optimization methods
