775 citations
- Eindhoven University of TechnologyNL24 papers
- Centrum Wiskunde & InformaticaNL23 papers
- University of AmsterdamNL14 papers
- Centre National de la Recherche ScientifiqueFR9 papers
- University College LondonGB9 papers
- Maastricht UniversityNL8 papers
- Delft University of TechnologyNL7 papers
- UCLouvainBE7 papers
- Universitat Politècnica de CatalunyaES7 papers
- University of AntwerpBE7 papers
- University of GroningenNL7 papers
- Georgia Institute of TechnologyUS6 papers
5 papers · 2 filters
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…
A refined error analysis for fixed-degree polynomial optimization over the simplex
Zhao Sun
We consider the problem of minimizing a fixed-degree polynomial over the standard simplex. This problem is well known to be NP-hard, since it contains the maximum stable set proble…
Semidefinite programming and eigenvalue bounds for the graph partition problem
Edwin R. van Dam, Renata Sotirov
The graph partition problem is the problem of partitioning the vertex set of a graph into a fixed number of sets of given sizes such that the sum of weights of edges joining differ…
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…
Positive Semidefinite Matrix Completion, Universal Rigidity and the Strong Arnold Property
M. Laurent, A. Varvitsiotis
This paper addresses the following three topics: positive semidefinite (psd) matrix completions, universal rigidity of frameworks, and the Strong Arnold Property (SAP). We show som…