Sparsity in sums of squares of polynomials

被引：0
|
作者：
Masakazu Kojima
Sunyoung Kim
Hayato Waki
机构：
[1] Tokyo Institute of Technology,Department of Mathematical and Computing Sciences
[2] Ewha Women’s University,Department of Mathematics
来源：
Mathematical Programming | 2005年 / 103卷
关键词：
Sums of squares of polynomial; Polynomial optimization problem; Semidefinite program; Sparsity;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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
页数：17
相关论文
共 50 条
12345