The following pages link to (Q4272843):
Displaying 12 items.
- A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models (Q261002) (← links)
- Minimax optimal designs via particle swarm optimization methods (Q261033) (← links)
- Optimal designs for comparing curves (Q292879) (← links)
- Minimal number of support points for mini-max optimal designs (Q689536) (← links)
- A geometric characterization of \(c\)-optimal designs for heteroscedastic regression (Q1043723) (← links)
- \(G\)-optimal designs for multi-factor experiments with heteroscedastic errors (Q1330225) (← links)
- A minimax algorithm for constructing optimal symmetrical balanced designs for a logistic regression model (Q1589690) (← links)
- On the equivalence of D and G-optimal designs in heteroscedastic models (Q1907925) (← links)
- An algorithmic construction of optimal minimax designs for heteroscedastic linear models (Q1973286) (← links)
- \(G\)-optimal designs for hierarchical linear models: an equivalence theorem and a nature-inspired meta-heuristic algorithm (Q2100440) (← links)
- Minimax \(D\)-optimal designs for item response theory models (Q2250639) (← links)
- Discussion: A general approach to \(D\)-optimal designs for weighted univariate polynomial regression models (Q2510913) (← links)
