ON THE COMPLEXITY OF SEMIDEFINITE PROGRAMS ARISING IN POLYNOMIAL OPTIMIZATION
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.
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Croatian Operational Research Society
2012-12-01
|
Series: | Croatian Operational Research Review |
Subjects: | |
Online Access: | http://hrcak.srce.hr/index.php?show=clanak&id_clanak_jezik=142450 |
id |
doaj-e4643d5472d641d9871831c1db74c84a |
---|---|
record_format |
Article |
spelling |
doaj-e4643d5472d641d9871831c1db74c84a2020-11-25T01:45:15ZengCroatian Operational Research SocietyCroatian Operational Research Review1848-02251848-99312012-12-0131126136ON THE COMPLEXITY OF SEMIDEFINITE PROGRAMS ARISING IN POLYNOMIAL OPTIMIZATIONIgor KlepJanez PovhAngelika WiegeleIn 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.http://hrcak.srce.hr/index.php?show=clanak&id_clanak_jezik=142450optimizationsum of squaressemidefinite programmingpolynomialMatlab toolboxreal algebraic geometry |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Igor Klep Janez Povh Angelika Wiegele |
spellingShingle |
Igor Klep Janez Povh Angelika Wiegele ON THE COMPLEXITY OF SEMIDEFINITE PROGRAMS ARISING IN POLYNOMIAL OPTIMIZATION Croatian Operational Research Review optimization sum of squares semidefinite programming polynomial Matlab toolbox real algebraic geometry |
author_facet |
Igor Klep Janez Povh Angelika Wiegele |
author_sort |
Igor Klep |
title |
ON THE COMPLEXITY OF SEMIDEFINITE PROGRAMS ARISING IN POLYNOMIAL OPTIMIZATION |
title_short |
ON THE COMPLEXITY OF SEMIDEFINITE PROGRAMS ARISING IN POLYNOMIAL OPTIMIZATION |
title_full |
ON THE COMPLEXITY OF SEMIDEFINITE PROGRAMS ARISING IN POLYNOMIAL OPTIMIZATION |
title_fullStr |
ON THE COMPLEXITY OF SEMIDEFINITE PROGRAMS ARISING IN POLYNOMIAL OPTIMIZATION |
title_full_unstemmed |
ON THE COMPLEXITY OF SEMIDEFINITE PROGRAMS ARISING IN POLYNOMIAL OPTIMIZATION |
title_sort |
on the complexity of semidefinite programs arising in polynomial optimization |
publisher |
Croatian Operational Research Society |
series |
Croatian Operational Research Review |
issn |
1848-0225 1848-9931 |
publishDate |
2012-12-01 |
description |
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. |
topic |
optimization sum of squares semidefinite programming polynomial Matlab toolbox real algebraic geometry |
url |
http://hrcak.srce.hr/index.php?show=clanak&id_clanak_jezik=142450 |
work_keys_str_mv |
AT igorklep onthecomplexityofsemidefiniteprogramsarisinginpolynomialoptimization AT janezpovh onthecomplexityofsemidefiniteprogramsarisinginpolynomialoptimization AT angelikawiegele onthecomplexityofsemidefiniteprogramsarisinginpolynomialoptimization |
_version_ |
1725024150575120384 |