114 citations · 264 across the 42 of their papers we have counts for
Showing 2013 · math.OCShow all
3 papers · 2 filters
math.OC2013
Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone
Monique Laurent, Teresa Piovesan
We investigate the completely positive semidefinite cone , a new matrix cone consisting of all matrices that admit a Gram representation by positive s…
math.OC2013★ 2 cited
An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex
Etienne de Klerk, Monique Laurent, Zhao Sun
The problem of minimizing a polynomial over the standard simplex is one of the basic NP-hard nonlinear optimization problems --- it contains the maximum clique problem in graphs as…
math.OC2013
Handelman's hierarchy for the maximum stable set problem
Monique Laurent, Zhao Sun
The maximum stable set problem is a well-known NP-hard problem in combinatorial optimization, which can be formulated as the maximization of a quadratic square-free polynomial over…