ON THE COMPLEXITY OF SEMIDEFINITE PROGRAMS ARISING IN POLYNOMIAL OPTIMIZATIONReportar como inadecuado




ON THE COMPLEXITY OF SEMIDEFINITE PROGRAMS ARISING IN POLYNOMIAL OPTIMIZATION - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

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



Autor: Igor Klep - Janez Povh - Angelika Wiegele -

Fuente: http://hrcak.srce.hr/



DESCARGAR PDF




Documentos relacionados