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
Showing 2009 · math.OCShow all
3 papers · 2 filters
math.OC2009★ 25 cited
The positive semidefinite Grothendieck problem with rank constraint
Jop Briet, Fernando Mario de Oliveira Filho, Frank Vallentin
Given a positive integer n and a positive semidefinite matrix A = (A_{ij}) of size m x m, the positive semidefinite Grothendieck problem with rank-n-constraint (SDP_n) is maximize…
math.OC2009★ 19 cited
A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs
João Gouveia, Monique Laurent, Pablo A. Parrilo +1
The theta bodies of a polynomial ideal are a series of semidefinite programming relaxations of the convex hull of the real variety of the ideal. In this paper we construct the thet…
math.OC2009★ 42 cited
On semidefinite programming relaxations of the traveling salesman problem
Etienne de Klerk, Dmitrii V. Pasechnik, Renata Sotirov
We consider a new semidefinite programming (SDP) relaxation of the symmetric traveling salesman problem (TSP) that may be obtained via an SDP relaxation of the more general quadrat…