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 条
  • [41] Dimensional Differences Between Faces of the Cones of Nonnegative Polynomials and Sums of Squares
    Blekherman, Grigoriy
    Iliman, Sadik
    Juhnke-Kubitzke, Martina
    [J]. COMBINATORIAL METHODS IN TOPOLOGY AND ALGEBRA, 2015, 12 : 69 - 77
  • [42] Polynomials in R[x, y] that are sums of squares in R(x, y)
    Leep, DB
    Starr, CL
    [J]. PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2001, 129 (11) : 3133 - 3141
  • [43] Global optimization of polynomials restricted to a smooth variety using sums of squares
    Greuet, Aurelien
    Guo, Feng
    El Din, Mohab Safey
    Zhi, Lihong
    [J]. JOURNAL OF SYMBOLIC COMPUTATION, 2012, 47 (05) : 503 - 518
  • [44] Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
    Gvozdenovic, Nebojsa
    Laurent, Monique
    [J]. MATHEMATICAL PROGRAMMING, 2007, 110 (01) : 145 - 173
  • [45] Dimensional Differences Between Faces of the Cones of Nonnegative Polynomials and Sums of Squares
    Blekherman, Grigoriy
    Iliman, Sadik
    Kubitzke, Martina
    [J]. INTERNATIONAL MATHEMATICS RESEARCH NOTICES, 2015, 2015 (18) : 8437 - 8470
  • [46] Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
    Nebojša Gvozdenović
    Monique Laurent
    [J]. Mathematical Programming, 2007, 110 : 145 - 173
  • [47] Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
    Gvozdenovic, N
    Laurent, M
    [J]. INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2005, 3509 : 136 - 151
  • [48] GLOBAL OPTIMIZATION OF POLYNOMIALS USING THE TRUNCATED TANGENCY VARIETY AND SUMS OF SQUARES
    Vui, Ha Huy
    Son, Pham Tien
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2008, 19 (02) : 941 - 951
  • [49] Sums, and sums of squares
    Beardon, A. F.
    [J]. MATHEMATICAL GAZETTE, 2023, 107 (570): : 488 - 490
  • [50] Sums of integers and sums of their squares
    Hoffmann, Detlev W.
    [J]. ACTA ARITHMETICA, 2020, 194 (03) : 295 - 313
12345