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

Sander Gribling, Sven Polak, Lucas Slot. A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization. In Alicia Dickenstein, Elias P. Tsigaridas, Gabriela Jeronimo, editors, Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, ISSAC 2023, Tromsø, Norway, July 24-27, 2023. pages 280-288, ACM, 2023. [doi]

Abstract

Abstract is missing.