114 citations · 264 across the 42 of their papers we have counts for
47 papers
Copositive matrices, sums of squares and the stability number of a graph
Luis Felipe Vargas, Monique Laurent
This chapter investigates the cone of copositive matrices, with a focus on the design and analysis of conic inner approximations for it. These approximations are based on various s…
Semidefinite approximations for bicliques and biindependent pairs
Monique Laurent, Sven Polak, Luis Felipe Vargas
We investigate some graph parameters dealing with biindependent pairs in a bipartite graph , i.e., pairs where , …
Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks
Milan Korda, Monique Laurent, Victor Magron +1
We explore a new type of sparsity for the generalized moment problem (GMP) that we call ideal-sparsity. This sparsity exploits the presence of equality constraints requiring the me…
On the Exactness of Sum-of-Squares Approximations for the Cone of Copositive Matrices
Monique Laurent, Luis Felipe Vargas
We investigate the hierarchy of conic inner approximations () for the copositive cone , introduced by Parrilo (Structured Semid…
Bounding the separable rank via polynomial optimization
Sander Gribling, Monique Laurent, Andries Steenkamp
We investigate questions related to the set consisting of the linear maps acting on that can be written as a convex combina…
Exactness of Parrilo's conic approximations for copositive matrices and associated low order bounds for the stability number of a graph
Monique Laurent, Luis Felipe Vargas
De Klerk and Pasechnik (2002) introduced the bounds () for the stability number of a graph and conjectured exactness at order $α(G)…