Best Principal Submatrix Selection for the Maximum Entropy Sampling Problem: Scalable Algorithms and Performance Guarantees (Q6333372)
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 |
preprint article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Best Principal Submatrix Selection for the Maximum Entropy Sampling Problem: Scalable Algorithms and Performance Guarantees |
preprint article from arXiv |
Statements
23 January 2020
0 references
stat.ML
0 references
cs.LG
0 references
math.OC
0 references
Yongchun Li
0 references
Weijun Xie
0 references
