114 citations · 264 across the 42 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.OC2019★ 21 cited
Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets
Lucas Slot, Monique Laurent
We consider the problem of computing the minimum value of a polynomial over a compact set , which can be reformulated as finding a probab…
math.OC2019
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
Etienne de Klerk, Monique Laurent
We study the convergence rate of a hierarchy of upper bounds for polynomial minimization problems, proposed by Lasserre [SIAM J. Optim. 21(3) (2011), pp. 864-885], for the special…
quant-ph2019★ 2 cited
Semidefinite programming formulations for the completely bounded norm of a tensor
Sander Gribling, Monique Laurent
We show that a certain tensor norm, the completely bounded norm, can be expressed by a semidefinite program. This tensor norm recently attracted attention in the field of quantum c…