Alternative SDP and SOCP approximations for polynomial optimization
In theory, hierarchies of semidefinite programming (SDP) relaxations based on sum of squares (SOS) polynomials have been shown to provide arbitrarily close approximations for a general polynomial optimization problem (POP). However, due to the computational challenge of solving SDPs, it becomes diff...
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | article |
| Langue: | EN |
| Publié: |
Elsevier
2019
|
| Sujets: | |
| Accès en ligne: | https://doaj.org/article/3e521043222c4f23ad2ab9727edb1587 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Soyez le premier à ajouter un commentaire!