期刊
SIAM JOURNAL ON OPTIMIZATION
卷 17, 期 1, 页码 218-242出版社
SIAM PUBLICATIONS
DOI: 10.1137/050623802
关键词
polynomial optimization problem; sparsity; global optimization; Lagrangian relaxation; Lagrangian dual; sums of squares optimization; semidefinite program relaxation
Unconstrained and inequality constrained sparse polynomial optimization problems (POPs) are considered. A correlative sparsity pattern graph is defined to find a certain sparse structure in the objective and constraint polynomials of a POP. Based on this graph, sets of the supports for sums of squares ( SOS) polynomials that lead to efficient SOS and semidefinite program ( SDP) relaxations are obtained. Numerical results from various test problems are included to show the improved performance of the SOS and SDP relaxations.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据