Degree Bounds for Polynomial Verification of the Matrix Cube Problem

Simple item page
dc.creatorChen, Been-Der
dc.creatorLall, Sanjay
dc.date2006-04-26
dc.date.accessioned2026-07-07T07:11:18Z
dc.date.available2026-07-07T07:11:18Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/math/0604573
dc.identifierhttp://arxiv.org/abs/math/0604573
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/111706
dc.subjectOptimization and Control
dc.titleDegree Bounds for Polynomial Verification of the Matrix Cube Problem
dc.typetext

Files

Collections

arXiv