Related papers: Certificates for nonnegativity of multivariate int…
Real algebraic geometry provides certificates for the positivity of polynomials on semi-algebraic sets by expressing them as a suitable combination of sums of squares and the defining inequalitites. We show how Putinar's theorem for…
This paper introduces a notion of decomposition and completion of sum-of-squares (SOS) matrices. We show that a subset of sparse SOS matrices with chordal sparsity patterns can be equivalently decomposed into a sum of multiple SOS matrices…
A noncommutative (nc) polynomial is called (globally) trace-positive if its evaluation at any tuple of operators in a tracial von Neumann algebra has nonnegative trace. Such polynomials emerge as trace inequalities in several matrix or…
In this article we provide an experimental algorithm that in many cases gives us an upper bound of the global infimum of a real polynomial on $\R^{n}$. It is very well known that to find the global infimum of a real polynomial on $\R^{n}$,…
In this paper, we investigate the verification of dissipativity properties for polynomial systems without an explicitly identified model but directly from noise-corrupted measurements. Contrary to most data-driven approaches for nonlinear…
The question how to certify non-negativity of a polynomial function lies at the heart of Real Algebra and also has important applications to Optimization. In this article we investigate the question of non-negativity in the context of…
In this article, we propose a geometric programming method in order to compute lower bounds for real polynomials. We provide new sufficient conditions for polynomials to be nonnegative as well as to have a sum of binomial squares…
A barrier certificate, defined over the states of a dynamical system, is a real-valued function whose zero level set characterizes an inductively verifiable state invariant separating reachable states from unsafe ones. When combined with…
In this paper, we explain a procedure based on a classical result of Sturm that can be used to determine rigorously whether a given trigonometric polynomial is nonnegative in a certain interval or not. Many examples are given. This…
Convexification is a core technique in global polynomial optimization. Currently, there are two main approaches competing in theory and practice: the approach of nonlinear programming and the approach based on positivity certificates from…
Semidefinite relaxations of polynomial optimization have become a central tool for addressing the non-convex optimization problems over non-commutative operators that are ubiquitous in quantum information theory and, more in general,…
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…
Digital signatures are fundamental cryptographic primitives that ensure the authenticity and integrity of digital documents. In the post-quantum era, classical public key-based signature schemes become vulnerable to brute-force and…
A complete intersection of n polynomials in n indeterminates has only a finite number of zeros. In this paper we address the following question: how do the zeros change when the coefficients of the polynomials are perturbed? In the first…
We study sum of squares (SOS) relaxations to optimize polynomial functions over a set $V\cap R^n$, where $V$ is a complex algebraic variety. We propose a new methodology that, rather than relying on some algebraic description, represents…
Unlike matrix completion, tensor completion does not have an algorithm that is known to achieve the information-theoretic sample complexity rate. This paper develops a new algorithm for the special case of completion for nonnegative…
We present a new sumcheck protocol called Fold-DCS (Fold-Divide-and-Conquer-Sumcheck) for multivariate polynomials based on a divide-and-conquer strategy. Its round complexity and soundness error are logarithmic in the number of variables,…
We offer a digital signature scheme using Boolean automorphisms of a multivariate polynomial algebra over integers. Verification part of this scheme is based on the approximation of the number of zeros of a multivariate Boolean function.
A set of high dimensional points $X=\{x_1, x_2,\ldots, x_n\} \subset R^d$ in isotropic position is said to be $\delta$-anti concentrated if for every direction $v$, the fraction of points in $X$ satisfying $|\langle x_i,v \rangle |\leq…
We present a symbolic perturbation scheme for arbitrary polynomial geometric predicates which combines the benefits of Emiris and Canny's simple randomized linear perturbation scheme with Yap's multiple infinitesimal scheme for general…