期刊
JOURNAL OF GLOBAL OPTIMIZATION
卷 65, 期 2, 页码 175-190出版社
SPRINGER
DOI: 10.1007/s10898-015-0356-6
关键词
Global continuous optimization; Sparse polynomial optimization; Structured sparsity; Sums of squares polynomials; Semidefinite programming relaxations
资金
- Australian Research Council
- NRF [2012-R1A1A2-038982, 2014-R1A2A1A11049618]
- Basic Science Research Program through National Research Foundation of Korea (NRF) - Ministry of Education [NRF-2013R1A1A2005378]
We propose a hierarchy of semidefinite programming (SDP) relaxations for polynomial optimization with sparse patterns over unbounded feasible sets. The convergence of the proposed SDP hierarchy is established for a class of polynomial optimization problems. This is done by employing known sums-of-squares sparsity techniques of Kojima and Muramatsu Comput Optim Appl 42(1):31-41, (2009) and Lasserre SIAM J Optim 17:822-843, (2006) together with a representation theorem for polynomials over unbounded sets obtained recently in Jeyakumar et al. J Optim Theory Appl 163(3):707-718, (2014). We demonstrate that the proposed sparse SDP hierarchy can solve some classes of large scale polynomial optimization problems with unbounded feasible sets using the polynomial optimization solver SparsePOP developed by Waki et al. ACM Trans Math Softw 35:15 (2008).
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据