A bounded degree SOS hierarchy for polynomial optimization (Q2397758): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SPOTless / rank | |||
Normal rank | |||
Revision as of 22:06, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bounded degree SOS hierarchy for polynomial optimization |
scientific article |
Statements
A bounded degree SOS hierarchy for polynomial optimization (English)
0 references
23 May 2017
0 references
global optimization
0 references
polynomial optimization
0 references
convex relaxations
0 references
LP and semidefinite hierarchies
0 references
