Related papers: Density, Determinacy, Duality and a Regularized Mo…
We establish the unique ergodicity of a fully discrete scheme for monotone SPDEs with polynomial growth drift and bounded diffusion coefficients driven by multiplicative white noise. The main ingredient of our method depends on the…
The Arrow Decomposition (AD) technique, initially introduced in [Mathematical Programming 190(1-2) (2021), pp 105-134], demonstrated superior scalability over the classical chordal decomposition in the context of Linear Matrix Inequalities…
The problem of convergence of the joint moments, which depend on two parameters $s$ and $h$, of the characteristic polynomial of a random Haar-distributed unitary matrix and its derivative, as the matrix size goes to infinity, has been…
This paper presents a novel algorithm for constructing a sum-of-squares (SOS) decomposition for positive semi-definite polynomials with rational coefficients. Unlike previous methods that typically yield SOS decompositions with…
In this survey we consider polynomial optimization problems, asking to minimize a polynomial function over a compact semialgebraic set, defined by polynomial inequalities. This models a great variety of (in general, nonlinear nonconvex)…
The sum-of-squares hierarchy of semidefinite programs has become a common tool for algorithm design in theoretical computer science, including problems in quantum information. In this work we study a connection between a Hermitian version…
The emphasis of this paper is to investigate the high-order approximation of a class of SPDEs with cubic nonlinearity driven by multiplicative noise with the help of the amplitude equations. The highlight of our work is that we improve the…
We prove that there is no relaxation gap between a quasi-dissipative nonlinear evolution equation in a Hilbert space and its linear Liouville equation reformulation on probability measures. In other words, strong and generalized solutions…
Global optimization has gained attraction over the past decades, thanks to the development of both theoretical foundations and efficient numerical routines. Among recent advances, Kernel Sum of Squares (KernelSOS) provides a powerful…
We consider symmetric (under the action of products of finite symmetric groups) real algebraic varieties and semi-algebraic sets, as well as symmetric complex varieties in affine and projective spaces, defined by polynomials of degrees…
This paper addresses a quadratic problem with assignment constraints, an NP-hard combinatorial optimization problem arisen from facility location, multiple-input multiple-output detection, and maximum mean discrepancy calculation et al. The…
The dynamics of many systems from physics, economics, chemistry, and biology can be modelled through polynomial functions. In this paper, we provide a computational means to find positively invariant sets of polynomial dynamical systems by…
The design of minimum-compliance bending-resistant structures with continuous cross-section parameters is a challenging task because of its inherent non-convexity. Our contribution develops a strategy that facilitates computing all…
Computations of incompressible flows with velocity boundary conditions require solution of a Poisson equation for pressure with all Neumann boundary conditions. Discretization of such a Poisson equation results in a rank-deficient matrix of…
A function of a matrix is polyconvex when it can be expressed as a convex function of the matrix minors. Polyconvexity is a regularity condition ensuring existence of minimizers in nonlinear elasticity and, more broadly, in vectorial…
The path to the solution of Feder-Vardi dichotomy conjecture by Bulatov and Zhuk led through showing that more and more general algebraic conditions imply polynomial-time algorithms for the finite-domain Constraint Satisfaction Problems…
This paper studies how to certify the convergence of Lasserre's hierarchy of semidefinite programming relaxations for solving multivariate polynomial optimization. We propose flat truncation as a general certificate for this purpose. Assume…
In this paper, we develop machinery which makes it much easier to prove sum of squares lower bounds when the problem is symmetric under permutations of $[1,n]$ and the unsatisfiability of our problem comes from integrality arguments, i.e.…
We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…
We study the convergence rate of moment-sum-of-squares hierarchies of semidefinite programs for optimal control problems with polynomial data. It is known that these hierarchies generate polynomial under-approximations to the value function…