A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization
International audience
Published in: | Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation |
---|---|
Main Authors: | , , |
Other Authors: | , , , , , , , |
Format: | Conference Object |
Language: | English |
Published: |
HAL CCSD
2023
|
Subjects: | |
Online Access: | https://hal.science/hal-04533765 https://doi.org/10.1145/3597066.3597075 |
id |
ftanrparis:oai:HAL:hal-04533765v1 |
---|---|
record_format |
openpolar |
spelling |
ftanrparis:oai:HAL:hal-04533765v1 2024-09-15T18:39:20+00:00 A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization Gribling, Sander Polak, Sven Slot, Lucas Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)) Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité) Centrum Wiskunde & Informatica (CWI) Department of Mathematics ETH Zurich (D-MATH) Eidgenössische Technische Hochschule - Swiss Federal Institute of Technology Zürich (ETH Zürich) ANR-18-CE47-0010,QuDATA,Algorithmes quantiques pour données massives(2018) ANR-22-PETQ-0007,EPiQ,Etude de la pile quantique : Algorithmes, modèles de calcul et simulation pour l'informatique quantique(2022) ANR-22-QUA2-0007,QOPT,Quantum algorithms for optimization(2022) Tromsø, Norway 2023-06-24 https://hal.science/hal-04533765 https://doi.org/10.1145/3597066.3597075 en eng HAL CCSD ACM info:eu-repo/semantics/altIdentifier/arxiv/2305.14944 info:eu-repo/semantics/altIdentifier/doi/10.1145/3597066.3597075 hal-04533765 https://hal.science/hal-04533765 ARXIV: 2305.14944 doi:10.1145/3597066.3597075 ISSAC 2023: International Symposium on Symbolic and Algebraic Computation 2023 https://hal.science/hal-04533765 ISSAC 2023: International Symposium on Symbolic and Algebraic Computation 2023, Jun 2023, Tromsø, Norway. pp.280-288, ⟨10.1145/3597066.3597075⟩ [INFO]Computer Science [cs] info:eu-repo/semantics/conferenceObject Conference papers 2023 ftanrparis https://doi.org/10.1145/3597066.3597075 2024-07-12T10:41:41Z International audience Conference Object Tromsø Portail HAL-ANR (Agence Nationale de la Recherche) Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation 280 288 |
institution |
Open Polar |
collection |
Portail HAL-ANR (Agence Nationale de la Recherche) |
op_collection_id |
ftanrparis |
language |
English |
topic |
[INFO]Computer Science [cs] |
spellingShingle |
[INFO]Computer Science [cs] Gribling, Sander Polak, Sven Slot, Lucas A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization |
topic_facet |
[INFO]Computer Science [cs] |
description |
International audience |
author2 |
Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)) Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité) Centrum Wiskunde & Informatica (CWI) Department of Mathematics ETH Zurich (D-MATH) Eidgenössische Technische Hochschule - Swiss Federal Institute of Technology Zürich (ETH Zürich) ANR-18-CE47-0010,QuDATA,Algorithmes quantiques pour données massives(2018) ANR-22-PETQ-0007,EPiQ,Etude de la pile quantique : Algorithmes, modèles de calcul et simulation pour l'informatique quantique(2022) ANR-22-QUA2-0007,QOPT,Quantum algorithms for optimization(2022) |
format |
Conference Object |
author |
Gribling, Sander Polak, Sven Slot, Lucas |
author_facet |
Gribling, Sander Polak, Sven Slot, Lucas |
author_sort |
Gribling, Sander |
title |
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization |
title_short |
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization |
title_full |
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization |
title_fullStr |
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization |
title_full_unstemmed |
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization |
title_sort |
note on the computational complexity of the moment-sos hierarchy for polynomial optimization |
publisher |
HAL CCSD |
publishDate |
2023 |
url |
https://hal.science/hal-04533765 https://doi.org/10.1145/3597066.3597075 |
op_coverage |
Tromsø, Norway |
genre |
Tromsø |
genre_facet |
Tromsø |
op_source |
ISSAC 2023: International Symposium on Symbolic and Algebraic Computation 2023 https://hal.science/hal-04533765 ISSAC 2023: International Symposium on Symbolic and Algebraic Computation 2023, Jun 2023, Tromsø, Norway. pp.280-288, ⟨10.1145/3597066.3597075⟩ |
op_relation |
info:eu-repo/semantics/altIdentifier/arxiv/2305.14944 info:eu-repo/semantics/altIdentifier/doi/10.1145/3597066.3597075 hal-04533765 https://hal.science/hal-04533765 ARXIV: 2305.14944 doi:10.1145/3597066.3597075 |
op_doi |
https://doi.org/10.1145/3597066.3597075 |
container_title |
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation |
container_start_page |
280 |
op_container_end_page |
288 |
_version_ |
1810483722306191360 |