<--- Back to Details
First PageDocument Content
Date: 2011-06-06 01:41:37

ON THE LASSERRE HIERARCHY OF SEMIDEFINITE PROGRAMMING RELAXATIONS OF CONVEX POLYNOMIAL OPTIMIZATION PROBLEMS ETIENNE DE KLERK∗ AND MONIQUE LAURENT† Abstract. The Lasserre hierarchy of semidefinite programming approxi

Add to Reading List

Source URL: homepages.cwi.nl

Download Document from Source Website

File Size: 304,39 KB

Share Document on Facebook

Similar Documents