A Short note on non-symmetric semidefinite programming

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/83523

Title:	A Short note on non-symmetric semidefinite programming
Author:	Xhafa Xhafa, Fatos
Other authors:	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
Abstract:	We show that optimizing over non-symmetrical matrices is not polynomial solvable unless P=NP. This is in contrast to the symmetric case for which several polynomials time algorithms are known.
Subject(s):	-Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica -Concurrent algorithms -Parallel algorithms -AVL trees
Rights:
Document type:	Article - Published version Report
Share: