Exploiting term sparsity in noncommutative polynomial optimization (Q2231045): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: ComputeTW / rank | |||
Normal rank | |||
Revision as of 06:54, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exploiting term sparsity in noncommutative polynomial optimization |
scientific article |
Statements
Exploiting term sparsity in noncommutative polynomial optimization (English)
0 references
29 September 2021
0 references
term sparsity
0 references
noncommutative polynomial optimization
0 references
semidefinite relaxations
0 references
sum of Hermitian squares
0 references
eigenvalue optimization
0 references
trace optimization
0 references
