ON THE COMPLEXITY OF SEMIDEFINITE PROGRAMS ARISING IN POLYNOMIAL OPTIMIZATIONReport as inadecuate




ON THE COMPLEXITY OF SEMIDEFINITE PROGRAMS ARISING IN POLYNOMIAL OPTIMIZATION - Download this document for free, or read online. Document in PDF available to download.

Croatian Operational Research Review, Vol.3 No.1 December 2012. -

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.

optimization; sum of squares; semidefinite programming; polynomial; Matlab toolbox; real algebraic geometry



Author: Igor Klep - Janez Povh - Angelika Wiegele -

Source: http://hrcak.srce.hr/



DOWNLOAD PDF




Related documents