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...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
Elsevier
2017
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/f7a832f91ebf494a86d3f951e8a7e8fe |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|