Pages that link to "Item:Q961110"
From MaRDI portal
The following pages link to Computing \(c\)-optimal experimental designs using the simplex method of linear programming (Q961110):
Displayed 14 items.
- Two complexity results on \(c\)-optimality in experimental design (Q429521) (← links)
- A semidefinite programming study of the Elfving theorem (Q546096) (← links)
- Optimal prediction designs in finite discrete spectrum linear regression models (Q604646) (← links)
- Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming (Q629098) (← links)
- Removing inessential points in \(c\)-and \(A\)-optimal design (Q830728) (← links)
- Computing exact \(D\)-optimal designs by mixed integer second-order cone programming (Q888509) (← links)
- Computation of \(c\)-optimal designs for models with correlated observations (Q1658167) (← links)
- An algorithm based on semidefinite programming for finding minimax optimal designs (Q1662093) (← links)
- Adaptive grid semidefinite programming for finding optimal designs (Q1702022) (← links)
- Optimal experimental design for linear time invariant state-space models (Q2058773) (← links)
- Optimal design of multifactor experiments via grid exploration (Q2058892) (← links)
- Optimal exact designs of experiments via mixed integer nonlinear programming (Q2302472) (← links)
- Optimal design of experiments via linear programming (Q2374424) (← links)
- On computational complexity of construction of c -optimal linear regression models over finite experimental domains (Q2913226) (← links)