114 citations · 264 across the 42 of their papers we have counts for
4 papers · 1 filter
On the convergence rate of grid search for polynomial optimization over the simplex
Etienne de Klerk, Monique Laurent, Zhao Sun +1
We consider the approximate minimization of a given polynomial on the standard simplex, obtained by taking the minimum value over all rational grid points with given denominator ${…
Bound-constrained polynomial optimization using only elementary calculations
Etienne de Klerk, Jean Lasserre, Monique Laurent +1
We provide a monotone non increasing sequence of upper bounds () converging to the global minimum of a polynomial on simple sets like the unit hypercube. The no…
A Lex-BFS-based recognition algorithm for Robinsonian matrices
Monique Laurent, Matteo Seminaroti
Robinsonian matrices arise in the classical seriation problem and play an important role in many applications where unsorted similarity (or dissimilarity) information must be reord…
On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings
Sabine Burgdorf, Monique Laurent, Teresa Piovesan
We investigate structural properties of the completely positive semidefinite cone , consisting of all the symmetric matrices that admit a Gram repres…