Pages that link to "Item:Q261002"
From MaRDI portal
The following pages link to A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models (Q261002):
Displaying 16 items.
- Application of imperialist competitive algorithm to find minimax and standardized maximin optimal designs (Q134017) (← links)
- A Metaheuristic Adaptive Cubature Based Algorithm to Find Bayesian Optimal Designs for Nonlinear Models (Q134019) (← links)
- D-optimal designs based on the second-order least squares estimator (Q513688) (← links)
- An algorithm based on semidefinite programming for finding minimax optimal designs (Q1662093) (← links)
- Adaptive grid semidefinite programming for finding optimal designs (Q1702022) (← links)
- A relaxation procedure for calculating \((\Gamma\)-)minimax optimal designs (Q1773040) (← links)
- Computing maximin efficient experimental designs using the methods of semidefinite programming (Q1936672) (← links)
- An algorithmic construction of optimal minimax designs for heteroscedastic linear models (Q1973286) (← links)
- Using SeDuMi to find various optimal designs for regression models (Q2010813) (← links)
- Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion (Q2023572) (← links)
- Optimal experimental design for linear time invariant state-space models (Q2058773) (← links)
- Optimal design of multifactor experiments via grid exploration (Q2058892) (← links)
- A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination (Q2256741) (← links)
- Optimal Design of Experiments for Implicit Models (Q5881146) (← links)
- Optimal designs for comparing curves in regression models with asymmetric errors (Q6049413) (← links)
- ForLion: a new algorithm for D-optimal designs under general parametric statistical models with mixed factors (Q6606955) (← links)
