Sparsity in a Sum of Squares of Polynomials

@inproceedings{Kojima2003SparsityIA,
  title={Sparsity in a Sum of Squares of Polynomials},
  author={Masakazu Kojima and Sunyoung Kim and Hayato Waki},
  year={2003}
}
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 a sum of squares optimization and SDP (semidefinite programming) relaxation of polynomial optimization problems. We disscuss effective methods to get a simpler representation of a “sparse” polynomial as a sum of squares of sparse polynomials by eliminating redundancy.