B-411 Sums of Squares and Semidefinite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity

@inproceedings{Waki2004B411SO,
title={B-411 Sums of Squares and Semidefinite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity},
author={Hayato Waki and Sunyoung Kim and Masakazu Kojima and Masakazu Muramatsu},
year={2004}
}

Unconstrained and inequality constrained sparse polynomial optimization problems (POPs) are considered. A correlative sparsity pattern graph is defined to find a certain sparse structure in the objective and constraint polynomials of a POP. Based on this graph, sets of supports for sums of squares (SOS) polynomials that lead to efficient SOS and semidefinite programming (SDP) relaxations are obtained. Numerical results from various test problems are included to show the improved performance of… CONTINUE READING