Related papers: Positivity certificates and polynomial optimizatio…
We consider optimization problems with polynomial inequality constraints in non-commuting variables. These non-commuting variables are viewed as bounded operators on a Hilbert space whose dimension is not fixed and the associated polynomial…
In this paper we present a systematic way to describe exceptional Jacobi polynomials via two partitions. We give the construction of these polynomials and restate the known aspects of these polynomials in terms of their partitions. The aim…
We study structured optimization problems with polynomial objective function and polynomial equality constraints. The structure comes from a multi-grading on the polynomial ring in several variables. For fixed multi-degrees we determine the…
In this paper, we present a computational approach to certify almost sure reachability for discrete-time polynomial stochastic systems by turning drift--variant criteria into sum-of-squares (SOS) programs solved with standard semidefinite…
Binary quadratic Diophantine equations are of interest from the viewpoint of computational complexity theory. They contain as special cases many examples of natural problems apparantly occupying intermediate stages in the P-NP hierarchy,…
We consider semidefinite programming (SDP) approaches for solving the maximum satisfiability problem (MAX-SAT) and the weighted partial MAX-SAT. It is widely known that SDP is well-suited to approximate the (MAX-)2-SAT. Our work shows the…
The aim of this work is to certify lower bounds for real-valued multivariate functions, defined by semialgebraic or transcendental expressions. The certificate must be, eventually, formally provable in a proof system such as Coq. The…
One considers polynomial optimization problems with compact feasible set $\mathbf{\Omega}$ defined by SOS-concave polynomials $g_j$, and with a globally non-convex polynomial objective $f$. We show that if $f$ is strongly convex on…
Recent results in the study of the Hamilton Jacobi Bellman (HJB) equation have led to the discovery of a formulation of the value function as a linear Partial Differential Equation (PDE) for stochastic nonlinear systems with a mild…
For a given $\theta\in (-1,1)$, we find out all parameters $\alpha,\beta\in \{0,1\}$ such that, there exists a linear combination of Jacobi polynomials $J_{n+1}^{(\alpha,\beta)}(x)-C J_{n}^{(\alpha,\beta)}(x)$ which generates a Lobatto…
Symmetry and dominance breaking can be crucial for solving hard combinatorial search and optimisation problems, but the correctness of these techniques sometimes relies on subtle arguments. For this reason, it is desirable to produce…
We construct sum of squares certificates of non-negativity for two families of polynomials appearing as a variant by Collins, Dykema, and Torres-Ayala to H\"aegele's reformulation of a conjecture by Bessis, Moussa, and Villani.
We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive…
Using polynomial equations to model combinatorial problems has been a popular tool both in computational combinatorics as well as an approach to proving new theorems. In this paper, we look at several combinatorics problems modeled by…
Let M be an archimedean quadratic module of real t-by-t matrix polynomials in n variables, and let S be the set of all real n-tuples where each element of M is positive semidefinite. Our key finding is a natural bijection between the set of…
We consider the stability analysis of a large class of linear 1-D PDEs with polynomial data. This class of PDEs contains, as examples, parabolic and hyperbolic PDEs, PDEs with boundary feedback and systems of in-domain/boundary coupled…
We provide two certificates of convexity for arbitrary basic semi-algebraic sets of $\R^n$. The first one is based on a necessary and sufficient condition whereas the second one is based on a sufficient (but simpler) condition only. Both…
We study optimization programs given by a bilinear form over non-commutative variables subject to linear inequalities. Problems of this form include the entangled value of two-prover games, entanglement-assisted coding for classical…
This paper studies the solution existence of the continuous-time algebraic Riccati equation (CARE). We formulate the CARE as two constrained polynomial optimization problems, and then use Lasserre's hierarchy of semi-definite relaxations to…
In this paper, we consider an extension of Jacobi's symbol, the so called rational $2^k$-th power residue symbol. In Section 3, we prove a novel generalization of Zolotarev's lemma. In Sections 4, 5 and 6, we show that several hard…