Approximation Algorithms, Quantum Information and Semidefinite Optimization April 2015 - December 2019
Collection
Collection
-
On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings In Proceedings
S. Burgdorf (Sabine), M. Laurent (Monique) and T. Piovesan (Teresa)
January 2015
-
An error analysis for polynomial optimization over the simplex based on the multivariate hypergeometric distribution Article
SIAM Journal on Optimization, 25(3), 1498-1514.E. de Klerk (Etienne), M. Laurent (Monique) and Z. Sun (Zhao)
January 2015
-
On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings Tech Report
S. Burgdorf (Sabine), M. Laurent (Monique) and T. Piovesan (Teresa)
February 2015
-
June 2015
-
An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex Article
Mathematical Programming, 151(2), 433-457.E. de Klerk (Etienne), M. Laurent (Monique) and Z. Sun (Zhao)
July 2015 -
Improved convergence rates for Lasserre-type hierarchies of upper bounds for box-constrained polynomial optimization Tech Report
E. de Klerk (Etienne), R. Hess (Roxana) and M. Laurent (Monique)
March 2016
-
A breakthrough in sphere packing: the search for magic functions Article
Nieuw Archief voor Wiskunde, 17(3), 184-192.September 2016
-
On the convergence rate of grid search for polynomial optimization over the simplex Article
Optimization Letters, 11(3), 597-608.E. de Klerk (Etienne), M. Laurent (Monique), Z. Sun (Zhao) and J.C. Vera
March 2017