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 24 items.
- A vertex-exchange-method in D-optimal design theory (Q1081255) (← links)
- An adjustment algorithm for optimal run orders in design of experiments (Q1614839) (← links)
- Computing optimal experimental designs with respect to a compound Bayes risk criterion (Q1640941) (← links)
- Efficient computational algorithm for optimal continuous experimental designs (Q1713154) (← links)
- Optimal design with bounded density: Optimization algorithms of the exchange type (Q1824325) (← links)
- Heuristic optimization of experimental designs. (Q1872999) (← links)
- 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)
- Efficiency of the coordinate-exchange algorithm in constructing exact optimal discrete choice experiments (Q2324028) (← links)
- An unexpected connection between Bayes \(A\)-optimal designs and the group Lasso (Q2423178) (← links)
- A review of some exchange algorithms for constructing discrete \(D\)-optimal designs (Q2563622) (← links)
- Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm (Q2631342) (← links)
- Submodularity and randomized rounding techniques for optimal experimental design (Q2883636) (← links)
- Approximation Algorithms for <i>D</i>-optimal Design (Q3387934) (← links)
- Efficient computational algorithms for approximate optimal designs (Q3390584) (← links)
- Efficiencies of Rounded Optimal Approximate Designs for Small Samples (Q4469535) (← links)
- Minimax Efficient Random Experimental Design Strategies With Application to Model-Robust Design for Prediction (Q5881148) (← links)
- A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach (Q5963815) (← 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)
