A bounded degree SOS hierarchy for polynomial optimization
We consider a new hierarchy of semidefinite relaxations for the general polynomial optimization problem (P):f∗=min{f(x):x∈K} on a compact basic semi-algebraic set K⊂Rn. This hierarchy combines some advantages of the standard LP-relaxations associated with Krivine’s positivity certificate and some ad...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Elsevier
2017
|
| Subjects: | |
| Online Access: | https://doaj.org/article/f7a832f91ebf494a86d3f951e8a7e8fe |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|