Pages that link to "Item:Q3304857"
From MaRDI portal
The following pages link to A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments (Q3304857):
Displaying 11 items.
- Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion (Q2023572) (← links)
- A branch-and-bound algorithm for the exact optimal experimental design problem (Q2058883) (← links)
- Optimal design of multifactor experiments via grid exploration (Q2058892) (← links)
- Circuits for robust designs (Q2093130) (← links)
- The mixture design threshold accepting algorithm for generating \(D\)-optimal designs of the mixture models (Q2121428) (← links)
- Computing minimum-volume enclosing ellipsoids for large datasets (Q2129596) (← links)
- An unexpected connection between Bayes \(A\)-optimal designs and the group Lasso (Q2423178) (← links)
- Efficient computational algorithms for approximate optimal designs (Q3390584) (← links)
- Minimax Efficient Random Experimental Design Strategies With Application to Model-Robust Design for Prediction (Q5881148) (← links)
- ForLion: a new algorithm for D-optimal designs under general parametric statistical models with mixed factors (Q6606955) (← links)
- The polytope of optimal approximate designs: extending the selection of informative experiments (Q6657821) (← links)
