Pages that link to "Item:Q2349524"
From MaRDI portal
The following pages link to Fast algorithms for the minimum volume estimator (Q2349524):
Displaying 5 items.
- On greedy heuristics for computing D-efficient saturated subsets (Q1984679) (← links)
- Computing minimum-volume enclosing ellipsoids for large datasets (Q2129596) (← links)
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments (Q3304857) (← links)
- Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming (Q5058050) (← links)
- Robust Optimization for Models with Uncertain Second-Order Cone and Semidefinite Programming Constraints (Q5084645) (← links)
