矩阵立方体问题多项式验证的度界
Degree Bounds for Polynomial Verification of the Matrix Cube Problem
摘要:
本文研究了半代数集上矩阵不等式是否为半正定的计算检验问题。本文利用矩阵论正性反驳理论,给出了一类正性反驳的充分条件。当半代数集是一个超立方体时,我们给出了所需的证书多项式的次数的界。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。