114 citations · 264 across the 42 of their papers we have counts for
Showing 2014 · math.OCShow all
3 papers · 2 filters
math.OC2014★ 3 cited
Convergence analysis for Lasserre's measure--based hierarchy of upper bounds for polynomial optimization
Etienne de Klerk, Monique Laurent, Zhao Sun
We consider the problem of minimizing a continuous function f over a compact set K. We analyze a hierarchy of upper bounds proposed by Lasserre in [SIAM J. Optim. 21(3) (2011), pp.…
math.OC2014★ 1 cited
An error analysis for polynomial optimization over the simplex based on the multivariate hypergeometric distribution
Etienne de Klerk, Monique Laurent, Zhao Sun
We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known to be NP-hard, as it contains the maximum stable set problem in graph theory as a…
math.OC2014★ 1 cited
The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
Monique Laurent, Matteo Seminaroti
We present a new polynomially solvable case of the Quadratic Assignment Problem in Koopmans-Beckman form , by showing that the identity permutation is optimal when an…