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: | Igor Klep, Janez Povh, Angelika Wiegele |
---|---|
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 |
Similar Items
-
From combinatorial optimization to real algebraic geometry and back
by: Janez Povh
Published: (2014-12-01) -
Numerical algebraic geometry and semidefinite programming
by: Jonathan D. Hauenstein, et al.
Published: (2021-08-01) -
A Sum-of-Squares and Semidefinite Programming Approach for Maximum Likelihood DOA Estimation
by: Shu Cai, et al.
Published: (2016-12-01) -
LINEAR AND NONLINEAR SEMIDEFINITE PROGRAMMING
by: Walter Gómez Bofill, et al.
Published: (2014-12-01) -
OPTIMIZATION AND APPROXIMATION OF NC POLYNOMIALS WITH SUMS OF SQUARES
by: Kristijan Cafuta, et al.
Published: (2010-12-01)