On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems

标题
On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems
作者
关键词
-
出版物
SIAM JOURNAL ON OPTIMIZATION
Volume 21, Issue 3, Pages 824-832
出版商
Society for Industrial & Applied Mathematics (SIAM)
发表日期
2011-09-02
DOI
10.1137/100814147

向作者/读者发起求助以获取更多资源

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search