A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization (Q6081938): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:02, 10 July 2024
scientific article; zbMATH DE number 7760772
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization |
scientific article; zbMATH DE number 7760772 |
Statements
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization (English)
0 references
3 November 2023
0 references
computational complexity
0 references
moment-SOS hierarchy
0 references
moments
0 references
polynomial optimization
0 references
semidefinite programming
0 references
sums of squares
0 references
