Related papers: Generalized truncated moment problems with unbound…
Using the dual cone of sums of nonnegative circuits (SONC), we provide a relaxation of the global optimization problem to minimize an exponential sum and, as a special case, a multivariate real polynomial. Our approach builds on two key…
This paper introduces and develops the algebraic framework of moment polynomials, which are polynomial expressions in commuting variables and their formal mixed moments. Their positivity and optimization over probability measures supported…
In this paper we prove the global in time solvability of the continuous growth--fragmentation--coagulation equation with unbounded coagulation kernels, in spaces of functions having finite moments of sufficiently high order. The main tool…
We use moment-SOS (Sum Of Squares) relaxations to address the optimal control problem of the 1D heat equation perturbed with a nonlinear term. We extend the current framework of moment-based optimal control of PDEs to consider a quadratic…
Minimum-uncertainty squeezed states, related to a broad class of observables, are analyzed. Methods for characterizing such states are developed, which are based on numerical solutions of ordinary differential equations. As typical examples…
The generalized Nash equilibrium problem (GNEP) is a kind of game to find strategies for a group of players such that each player's objective function is optimized. Solutions for GNEPs are called generalized Nash equilibria (GNEs). In this…
It is known that positive definiteness is not enough for the multidimensional moment problem to be solved. We would like throw in to the garden of existing in this matter so far results one more, a result which takes into considerations the…
Certificates of polynomial nonnegativity can be used to obtain tight dual bounds for polynomial optimization problems. We consider Sums of Nonnegative Circuit (SONC) polynomials certificates, which are well suited for sparse problems since…
This paper proposes novel algorithm for non-convex multimodal constrained optimisation problems. It is based on sequential solving restrictions of problem to sections of feasible set by random subspaces (in general, manifolds) of low…
The Gauss image problem for convex bodies asks for the existence of a convex body that "links" two given measures on the unit sphere in a certain way. We treat here a corresponding question for pseudo-cones, that is, for unbounded closed…
Configuration-space matrix elements of N-body potentials arise naturally and ubiquitously in the Ritz-Galerkin solution of many-body quantum problems. For the common specialization of local, finite-range potentials, we develop the eXact…
In the present work, an approach to the moment closure problem on the basis of orthogonal polynomials derived from Gram matrices is proposed. Its properties are studied in the context of the moment closure problem arising in gas kinetic…
The two-dimensional moment problem consists of finding a positive Borel measure $\mu$ in $\mathbb{R}^2$ such that $\int_{\mathbb{R}^2} t_1^m t_2^n d\mu = s_{m,n}$, $m,n=0,1,2,...$, where $s_{m,n}$ are prescribed real constants (moments). We…
The Gromov-Wasserstein (GW) problem is an extension of the classical optimal transport problem to settings where the source and target distributions reside in incomparable spaces, and for which a cost function that attributes the price of…
In the present paper, classical tools of convex analysis are used to study the solution set to a certain class of set-inclusive generalized equations. A condition for the solution existence and global error bounds is established, in the…
Moment optimization techniques have been recently proposed to solve globally various classes of optimal control problems. As those methods return truncated moment sequences of occupation measures, this paper explores a numeric method for…
We study a limiting case of the Askey-Wilson polynomials when one of the parameters goes to infinity, namely continuous dual q-Hahn polynomials when q > 1. Solutions to the associated indeterminate moment problem by general theory are found…
We investigate the NP-Complete problem SAT and the geometry of its instances. For a particular type that we call {\it non-interlaced formulas}, we propose a polynomial time algorithm for their resolution using graphs and matrices.
This paper studies generalized Nash equilibrium problems that are given by rational functions. The optimization problems are not assumed to be convex. Rational expressions for Lagrange multipliers and feasible extensions of KKT points are…
Finding the minimum of a multivariate real polynomial is a well-known hard problem with various applications. We present a polynomial time algorithm to approximate such lower bounds via sums of nonnegative circuit polynomials (SONC). As a…