Polynomial Optimization, Efficiency through Moments and Algebra January 2019 - December 2022
Collection
Collection
-
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere Article
Mathematical Programming, 665-685.January 2020
-
Optimizing hypergraph-based polynomials modeling job-occupancy in queuing with redundancy scheduling Article
SIAM Journal on Optimization, 31(3), 2227-2254.D. Brosch, M. Laurent (Monique) and J.A.J. Steenkamp (Andries)
September 2021
-
Finite convergence of sum-of-squares hierarchies for the stability number of a graph Article
SIAM Journal on Optimization, 32(2), 491-518.April 2022
-
Exactness of Parrilo’s conic approximations for copositive matrices and associated low order bounds for the stability number of a graph Article
Mathematics of Operations Research, 1-27.September 2022 -
Bounding the separable rank via polynomial optimization Article
Linear Algebra and its Applications, 1-55.S.J. Gribling (Sander), M. Laurent (Monique) and J.A.J. Steenkamp (Andries)
September 2022
-
On the exactness of sum-of-squares approximations for the cone of 5 × 5 copositive matrices Article
Linear Algebra and its Applications, 26-50.October 2022
-
Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks Article
Mathematical Programming, 205:703-205:744.M. Korda (Korda), M. Laurent (Monique), V. Magron (Victor) and J.A.J. Steenkamp (Andries)
July 2023
-
October 2023