Pages that link to "Item:Q3387934"
From MaRDI portal
The following pages link to Approximation Algorithms for <i>D</i>-optimal Design (Q3387934):
Displaying 14 items.
- Two complexity results on \(c\)-optimality in experimental design (Q429521) (← links)
- Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments (Q513974) (← links)
- Robust experiment design via stochastic approximation (Q1076462) (← links)
- Approximation of a maximum-submodular-coverage problem involving spectral functions, with application to experimental designs (Q1759885) (← links)
- A branch-and-bound algorithm for the exact optimal experimental design problem (Q2058883) (← links)
- Multidimensional sum-up rounding for integer programming in optimal experimental design (Q2220654) (← links)
- Near-optimal discrete optimization for experimental design: a regret minimization approach (Q2227544) (← links)
- On proportional volume sampling for experimental design in general spaces (Q2677908) (← links)
- Submodularity and randomized rounding techniques for optimal experimental design (Q2883636) (← links)
- Design of algorithms for spatial-time reduction complexity of dynamic programming (Q4009211) (← links)
- Min-Max Optimal Design of Two-Armed Trials with Side Information (Q5084640) (← links)
- A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach (Q5963815) (← links)
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023 (Q6544493) (← links)
- Optimal experimental design: formulations and computations (Q6598420) (← links)
