A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization

Sven Polak
Lucas Slot

Dates et versions

hal-04533765 , version 1 (05-04-2024)

Identifiants

Citer

Sander Gribling, Sven Polak, Lucas Slot. A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization. ISSAC 2023: International Symposium on Symbolic and Algebraic Computation 2023, Jun 2023, Tromsø, Norway. pp.280-288, ⟨10.1145/3597066.3597075⟩. ⟨hal-04533765⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More