Degree Bounds for Polynomial Verification of the Matrix Cube Problem
Optimization and Control
2007-05-23 v1
Abstract
In this paper we consider the problem of how to computationally test whether a matrix inequality is positive semidefinite on a semialgebraic set. We propose a family of sufficient conditions using the theory of matrix Positivstellensatz refutations. When the semialgebraic set is a hypercube, we give bounds on the degree of the required certificate polynomials.
Cite
@article{arxiv.math/0604573,
title = {Degree Bounds for Polynomial Verification of the Matrix Cube Problem},
author = {Been-Der Chen and Sanjay Lall},
journal= {arXiv preprint arXiv:math/0604573},
year = {2007}
}