Pages that link to "Item:Q2349524"
From MaRDI portal
The following pages link to Fast algorithms for the minimum volume estimator (Q2349524):
Displaying 8 items.
- Scale-invariant clustering with minimum volume ellipsoids (Q941528) (← links)
- Complexity-penalized estimation of minimum volume sets for dependent data (Q990877) (← links)
- An easy way to increase the finite-sample efficiency of the resampled minimum volume ellipsoid estimator (Q1391245) (← links)
- 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)