期刊
OPERATIONS RESEARCH LETTERS
卷 42, 期 1, 页码 34-40出版社
ELSEVIER
DOI: 10.1016/j.orl.2013.11.005
关键词
Convex polynomial optimization; Sums-of-squares of polynomials; Semidefinite programming
资金
- Australian Research Council
- Vietnam National Foundation for Science and Technology Development (NAFOSTED) [101.04-2013.07]
We show that the Lasserre hierarchy of semidefinite programming (SDP) relaxations with a slightly extended quadratic module for convex polynomial optimization problems always converges asymptotically even in the case of non-compact semi-algebraic feasible sets. We then prove that the positive definiteness of the Hessian of the associated Lagrangian at a saddle-point guarantees the finite convergence of the hierarchy. We do this by establishing a new sum-of-squares polynomial representation of convex polynomials over convex semi-algebraic sets. (C) 2013 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据