A Short note on non-symmetric semidefinite programming
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.
| Autor: | |
|---|---|
| Tipo de documento: | relatório científico |
| Data de publicação: | 1997 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositório: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglês |
| OAI Identifier: | oai:upcommons.upc.edu:2117/83523 |
| Acesso em linha: | https://hdl.handle.net/2117/83523 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Concurrent algorithms Parallel algorithms AVL trees Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Resumo: | 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. |
|---|