A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization (Q6081938): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Add wikidata reference. |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q131124578 / rank | |||
Normal rank | |||
Latest revision as of 20:33, 16 December 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
0 references
0 references
