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 recurso: | informe técnico |
| Fecha de publicación: | 1997 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/83523 |
| Acceso en línea: | https://hdl.handle.net/2117/83523 |
| Access Level: | acceso abierto |
| Palabra clave: | Concurrent algorithms Parallel algorithms AVL trees Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Sumario: | 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. |
|---|