A more efficient reformulation of complex SDP as real SDP
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866908976473440256 |
|---|---|
| author | Wang, Jie |
| author_facet | Wang, Jie |
| contents | This note proposes a new reformulation of complex semidefinite programs (SDPs) as real SDPs. As an application, we present an economical reformulation of complex SDP relaxations of complex polynomial optimization problems as real SDPs and derive some further reductions by exploiting inner structure of the complex SDP relaxations. Various numerical examples demonstrate that our new reformulation runs significantly faster than the usual popular reformulation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2307_11599 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A more efficient reformulation of complex SDP as real SDP Wang, Jie Optimization and Control 90C22, 90C23 This note proposes a new reformulation of complex semidefinite programs (SDPs) as real SDPs. As an application, we present an economical reformulation of complex SDP relaxations of complex polynomial optimization problems as real SDPs and derive some further reductions by exploiting inner structure of the complex SDP relaxations. Various numerical examples demonstrate that our new reformulation runs significantly faster than the usual popular reformulation. |
| title | A more efficient reformulation of complex SDP as real SDP |
| topic | Optimization and Control 90C22, 90C23 |
| url | https://arxiv.org/abs/2307.11599 |