Best principal submatrix selection for the maximum entropy sampling problem: scalable algorithms and performance guarantees (Q6579643)
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: Best principal submatrix selection for the maximum entropy sampling problem: scalable algorithms and performance guarantees |
scientific article; zbMATH DE number 7887709
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Best principal submatrix selection for the maximum entropy sampling problem: scalable algorithms and performance guarantees |
scientific article; zbMATH DE number 7887709 |
Statements
Best principal submatrix selection for the maximum entropy sampling problem: scalable algorithms and performance guarantees (English)
0 references
25 July 2024
0 references
machine learning and data science
0 references
maximum entropy sampling problem
0 references
convex integer program
0 references
sampling algorithm
0 references
local search algorithm
0 references
A-optimality
0 references
