Sparsity in sums of squares of polynomials

被引：66
|
作者：
Kojima, M
Kim, S
Waki, H
机构：
[1] Tokyo Inst Technol, Dept Math & Comp Sci, Meguro Ku, Tokyo 1528552, Japan
[2] Ewha Womans Univ, Dept Math, Seoul 120750, South Korea
来源：
MATHEMATICAL PROGRAMMING | 2005年 / 103卷 / 01期
关键词：
sums of squares of polynomial; polynomial optimization problem; semidefinite program; sparsity;
D O I：
10.1007/s10107-004-0554-3
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
Representation of a given nonnegative multivariate polynomial in terms of a sum of squares of polynomials has become an essential subject in recent developments of sums of squares optimization and semidefinite programming (SDP) relaxation of polynomial optimization problems. We discuss effective methods to obtain a simpler representation of a "sparse" polynomial as a sum of squares of sparse polynomials by eliminating redundancy.
引用
收藏
页码：45 / 62
页数：18
相关论文
共 50 条
12345