An algorithmic construction of optimal minimax designs for heteroscedastic linear models
From MaRDI portal
Publication:1973286
Recommendations
- Optimal minimax designs for prediction in heteroscedastic models
- D-Optimum Designs for Heteroscedastic Linear Models
- Optimal minimax designs over a prespecified interval in a heteroscedastic polynomial model
- Minimax A‐, c‐, and I‐optimal regression designs for models with heteroscedastic errors
- Optimal designs for minimax-criteria in random coefficient regression models
- A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models
- Minimax robust designs for regression models with heteroscedastic errors
Cites work
- scientific article; zbMATH DE number 3945143 (Why is no real title available?)
- scientific article; zbMATH DE number 3502650 (Why is no real title available?)
- scientific article; zbMATH DE number 472979 (Why is no real title available?)
- scientific article; zbMATH DE number 3194891 (Why is no real title available?)
- A generalization of D- and \(D_ 1\)-optimal designs in polynomial regression
- Compromise designs in heteroscedastic linear models
- D-optimal designs on the unit \(q\)-ball
- Design for Optimal Prediction in Simple Linear Regression
- Duality of optimal designs for model discrimination and parameter estimation
- Efficient \(D_ s\)-optimal designs for multivariate polynomial regression on the q-cube
- Experimental designs for a class of weighted polynomial regression models
- Invited Discussion Paper Constrained Optimization of Experimental Design
- Minimal number of support points for mini-max optimal designs
- On a Theorem of Hoel and Levine on Extrapolation Designs
- On the Efficiency of Experimental Designs
- On the equivalence of D and G-optimal designs in heteroscedastic models
- Optimum extrapolation and interpolation designs. I, II
- The design of experiments for discriminating between two rival models
- \(G\)-optimal designs for multi-factor experiments with heteroscedastic errors
Cited in
(13)- V-optimal designs for heteroscedastic regression
- A geometric characterization of \(c\)-optimal designs for heteroscedastic regression
- A unified approach to the construction of minimax designs
- Minimax A‐, c‐, and I‐optimal regression designs for models with heteroscedastic errors
- Minimax robust designs for regression models with heteroscedastic errors
- A minimax algorithm for constructing optimal symmetrical balanced designs for a logistic regression model
- Algorithms for approximate linear regression design with application to a first order model with heteroscedasticity
- Optimal designs for testing the functional form of a regression via nonparametric estimation techniques
- Dual-objective optimal mixture designs
- Minimax optimal designs via particle swarm optimization methods
- Statistical Methods for Minimax Estimation in Linear Models with Unknown Design Over Finite Alphabets
- A combinatorial search technique for constructing optimal designs for biased models
- Optimal minimax designs over a prespecified interval in a heteroscedastic polynomial model
This page was built for publication: An algorithmic construction of optimal minimax designs for heteroscedastic linear models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1973286)
