Degree Bounds for Polynomial Verification of the Matrix Cube Problem
From MaRDI portal
(Redirected from Publication:6477079)
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.
This page was built for publication: Degree Bounds for Polynomial Verification of the Matrix Cube Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6477079)
