Grassmannian optimization is NP-hard (Q6931479)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8091935
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Grassmannian optimization is NP-hard |
scientific article; zbMATH DE number 8091935 |
Statements
Grassmannian optimization is NP-hard (English)
0 references
10 September 2025
0 references
Grassmannian
0 references
manifold optimization
0 references
NP-hard
0 references
Stiefel manifold
0 references
positive definite cone
0 references
0 references
0 references
0 references
0 references
0 references
