On greedy heuristics for computing D-efficient saturated subsets (Q1984679)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On greedy heuristics for computing D-efficient saturated subsets |
scientific article; zbMATH DE number 7186950
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On greedy heuristics for computing D-efficient saturated subsets |
scientific article; zbMATH DE number 7186950 |
Statements
On greedy heuristics for computing D-efficient saturated subsets (English)
0 references
7 April 2020
0 references
D-optimality
0 references
optimal experimental design
0 references
minimum-volume enclosing ellipsoid
0 references
subsampling
0 references
greedy heuristic
0 references
0 references
0 references
