Pages that link to "Item:Q429521"
From MaRDI portal
The following pages link to Two complexity results on \(c\)-optimality in experimental design (Q429521):
Displaying 7 items.
- Computing \(c\)-optimal experimental designs using the simplex method of linear programming (Q961110) (← links)
- Design of c-optimal experiments for high-dimensional linear models (Q2108501) (← links)
- Near-optimal discrete optimization for experimental design: a regret minimization approach (Q2227544) (← links)
- An unexpected connection between Bayes \(A\)-optimal designs and the group Lasso (Q2423178) (← links)
- Solving the Beck and Wieland model with optimal experimentation in \textit{DualPC} (Q2440760) (← links)
- On computational complexity of construction of \(c\)-optimal linear regression models over finite experimental domains (Q2913226) (← links)
- Gaussian Process Landmarking on Manifolds (Q5025781) (← links)