Related papers: Generalized truncated moment problems with unbound…
We study the moments finiteness problem for the class of Lipschitz maps $F: [a,b]\rightarrow\mathbb R^n$ with images in a compact Lipschitz triangulable curve $\Gamma$. We apply the obtained results to the center problem for ODEs describing…
We consider linear problems in the worst case setting. That is, given a linear operator and a pool of admissible linear measurements, we want to approximate the values of the operator uniformly on a convex and balanced set by means of…
This paper deals with (1) the truncated matrix Hamburger moment problem from the point of view of reproducing kernel Hilbert spaces of vector valued entire functions of the kind introduced and extensively studied by Louis de Branges and (2)…
This paper proposes a simple unified inference approach on moment restrictions in the presence of nuisance parameters. The proposed test is constructed based on a new characterization that avoids the estimation of nuisance parameters and…
For the truncated moment problem associated to a complex sequence $\gamma ^{(2n)}=\{\gamma _{ij}\}_{i,j\in Z_{+},i+j \leq 2n}$ to have a representing measure $\mu $, it is necessary for the moment matrix $M(n)$ to be positive semidefinite,…
Uniform bin width histograms are widely used so this data graphic should represent data as correctly as possible. Method of moments based on familiar mean, variance and Fisher-Pearson skewness cure this problem.
Model order reduction (MOR) is often applied to spatially-discretized partial differential equations to reduce their order and hence decrease computational complexity. A reduced system can be obtained, e.g., by time-limited balanced…
The H\"older continuity of the truncated moment map of a shade function in Euclidean space is established in the vicinity of a principal semi-algebraic set. The proof combines volume bounds of semi-algebraic sets and convex optimization…
In this paper, we consider a matroid generalization of the stable matching problem. In particular, we consider the setting where preferences may contain ties. For this generalization, we propose a polynomial-time algorithm for the problem…
We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…
In this paper we obtain an algorithm towards solving the two-dimensional moment problem. This algorithm gives the necessary and sufficient conditions for the solvability of the moment problem. It is shown that all solutions of the moment…
In this paper, we study the linear complementarity problems on the monotone extended second order cones. We demonstrate that the linear complementarity problem on the monotone extended second order cone can be converted into a mixed…
This paper concerns a space-time homogenization limit of nonnegative weak solutions to porous medium equations. In particular, the so-called homogenized matrix will be characterized in terms of solutions to cell problems, which drastically…
Given a manifold $\mathbb{M}$ admitting a maximally supersymmetric consistent truncation, we show how to formulate new consistent truncations by restricting to a set of Kaluza-Klein modes on $\mathbb{M}$ invariant under some subgroup of the…
We propose a method to compute an approximation of the moments of a discrete-time stochastic polynomial system. We use the Carleman linearization technique to transform this finite-dimensional polynomial system into an infinite-dimensional…
A brief overview of dimensional reductions for diffeomorphism invariant theories is given. The distinction between the physical idea of compactification and the mathematical problem of a consistent truncation is discussed, and the typical…
This paper studies stochastic optimization problems with polynomials. We propose an optimization model with sample averages and perturbations. The Lasserre type Moment-SOS relaxations are used to solve the sample average optimization.…
Let A be a finite subset of N^n, and K be a compact semialgebraic set in R^n. An A-tms is a vector y indexed by elements in A. The A-truncated K-moment problem (A-TKMP) studies whether a given A-tms y admits a K-measure or not. This paper…
Moment evaluations are important for the study of non-classical orthogonal polynomial systems for which explicit representations are not known. In this paper we compute, in terms of the hypergeometric function, the moments associated with a…
In this paper we derive a moment relaxation for large-scale nonsmooth optimization problems with graphical structure and spherical constraints. In contrast to classical moment relaxations for global polynomial optimization that suffer from…