 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 approxiAdd to Reading ListSource URL: homepages.cwi.nlDownload Document from Source Website File Size: 304,39 KBShare Document on Facebook
|