A bounded degree SOS hierarchy for polynomial optimization (Q2397758)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A bounded degree SOS hierarchy for polynomial optimization |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0 references
0 references
0 references
0 references
0.8857426643371582
0 references
0.8453827500343323
0 references
0.844531774520874
0 references
0.8421153426170349
0 references
