A New Sparse SOS Decomposition Algorithm Based on Term Sparsity

DOI10.1145/3326229.3326254zbMath1467.68234arXiv1809.10848OpenAlexW2959479683MaRDI QIDQ5121129

Jie Wang, Haokun Li, Bican Xia

Publication date: 10 September 2020

Published in: Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.10848

zbMATH Keywords

chordal graphsum of squaressparse polynomialnonnegative polynomialcross sparsity pattern

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Semidefinite programming (90C22)

Related Items (7)

Algebraic Perspectives on Signomial Optimization ⋮ Nonnegative Polynomials and Circuit Polynomials ⋮ Partial Lasserre relaxation for sparse Max-Cut ⋮ Sum-of-squares chordal decomposition of polynomial matrix inequalities ⋮ Exploiting term sparsity in noncommutative polynomial optimization ⋮ TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity ⋮ Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension

This page was built for publication: A New Sparse SOS Decomposition Algorithm Based on Term Sparsity