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.

Detalles Bibliográficos
Autor: Xhafa Xhafa, Fatos|||0000-0001-6569-5497
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
id ES_3979bf9f149899da201da24d3f97d8a1
oai_identifier_str oai:upcommons.upc.edu:2117/83523
network_acronym_str ES
network_name_str España
repository_id_str
spelling A Short note on non-symmetric semidefinite programmingXhafa Xhafa, Fatos|||0000-0001-6569-5497Concurrent algorithmsParallel algorithmsAVL treesÀrees temàtiques de la UPC::Informàtica::Informàtica teòricaWe 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.19971997-07-0120162016-02-29reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/pdfhttps://hdl.handle.net/2117/83523reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/835232026-05-27T15:37:01Z
dc.title.none.fl_str_mv A Short note on non-symmetric semidefinite programming
title A Short note on non-symmetric semidefinite programming
spellingShingle A Short note on non-symmetric semidefinite programming
Xhafa Xhafa, Fatos|||0000-0001-6569-5497
Concurrent algorithms
Parallel algorithms
AVL trees
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
title_short A Short note on non-symmetric semidefinite programming
title_full A Short note on non-symmetric semidefinite programming
title_fullStr A Short note on non-symmetric semidefinite programming
title_full_unstemmed A Short note on non-symmetric semidefinite programming
title_sort A Short note on non-symmetric semidefinite programming
dc.creator.none.fl_str_mv Xhafa Xhafa, Fatos|||0000-0001-6569-5497
author Xhafa Xhafa, Fatos|||0000-0001-6569-5497
author_facet Xhafa Xhafa, Fatos|||0000-0001-6569-5497
author_role author
dc.subject.none.fl_str_mv Concurrent algorithms
Parallel algorithms
AVL trees
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
topic Concurrent algorithms
Parallel algorithms
AVL trees
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
description 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.
publishDate 1997
dc.date.none.fl_str_mv 1997
1997-07-01
2016
2016-02-29
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/83523
url https://hdl.handle.net/2117/83523
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869406166578102272
score 15,300719

Similares en LA Referencia