The following pages link to (Q2799905):
Displaying 19 items.
- Application of imperialist competitive algorithm to find minimax and standardized maximin optimal designs (Q134017) (← links)
- Near G-optimal Tchakaloff designs (Q782650) (← links)
- Optimizing two-level orthogonal arrays for simultaneously estimating main effects and pre-specified two-factor interactions (Q1662063) (← links)
- An algorithm based on semidefinite programming for finding minimax optimal designs (Q1662093) (← links)
- Adaptive grid semidefinite programming for finding optimal designs (Q1702022) (← links)
- Removal of the points that do not support an \(E\)-optimal experimental design (Q1726897) (← links)
- On greedy heuristics for computing D-efficient saturated subsets (Q1984679) (← links)
- Sparse polynomial chaos expansions via compressed sensing and D-optimal design (Q1985532) (← links)
- Using SeDuMi to find various optimal designs for regression models (Q2010813) (← links)
- A group comparison in fMRI data using a semiparametric model under shape invariance (Q2072394) (← links)
- Minimax D-optimal designs for multivariate regression models with multi-factors (Q2189106) (← links)
- A new monotonic algorithm for the \(E\)-optimal experiment design problem (Q2244437) (← links)
- A-ComVar: a flexible extension of common variance designs (Q2301233) (← links)
- Optimal exact designs of experiments via mixed integer nonlinear programming (Q2302472) (← links)
- Least squares polynomial chaos expansion: a review of sampling strategies (Q2310855) (← links)
- On multiple-objective optimal designs (Q2317275) (← links)
- Exact optimal experimental designs with constraints (Q2361462) (← links)
- Construction of efficient experimental designs under multiple resource constraints (Q4628716) (← links)
- Hybrid exact-approximate design approach for sparse functional data (Q6071710) (← links)
