ON THE COMPLEXITY OF SEMIDEFINITE PROGRAMS ARISING IN POLYNOMIAL OPTIMIZATION
Autor: | Igor Klep, Janez Povh, Angelika Wiegele |
---|---|
Jazyk: | angličtina |
Rok vydání: | 2012 |
Předmět: | |
Zdroj: | Croatian Operational Research Review, Vol 3, Iss 1, Pp 126-136 (2012) |
Druh dokumentu: | article |
ISSN: | 1848-0225 1848-9931 |
Popis: | In this paper we investigate matrix inequalities which hold irrespective of the size of the matrices involved, and explain how the search for such inequalities can be implemented as a semidefinite program (SDP). We provide a comprehensive discussion of the time complexity of these SDPs. |
Databáze: | Directory of Open Access Journals |
Externí odkaz: |