Related papers: Solving moment and polynomial optimization problem…
Several negative results are presented concerning the solvability in Sobolev classes of the Cauchy problem for the inhomogeneous second-order uniformly parabolic equations without lower order terms in one space dimension. The main…
This paper is about the moment problem on a finite-dimensional vector space of continuous functions. We investigate the structure of the convex cone of moment functionals (supporting hyperplanes, exposed faces, inner points) and treat…
This paper deals with the moment problem on a (not necessarily finitely generated) commutative unital real algebra $A$. We define moment functionals on $A$ as linear functionals which can be written as integrals over characters of $A$ with…
We consider a generic basic semi-algebraic subset $\mathcal{S}$ of the space of generalized functions, that is a set given by (not necessarily countably many) polynomial constraints. We derive necessary and sufficient conditions for an…
This work is a continuation of the recent study by the authors on approximation theory over the sphere and the ball. The main results define new Sobolev spaces on these domains and study polynomial approximations for functions in these…
In this paper, we consider a bilevel polynomial optimization problem where the objective and the constraint functions of both the upper and the lower level problems are polynomials. We present methods for finding its global minimizers and…
The paper addresses parametric inequality systems described by polynomial functions in finite dimensions, where state-dependent infinite parameter sets are given by finitely many polynomial inequalities and equalities. Such systems can be…
We consider min-max optimization problems for polynomial functions, where a multivariate polynomial is maximized with respect to a subset of variables, and the resulting maximal value is minimized with respect to the remaining variables.…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
We review and develop the classical theory of moments of configurations of weighted points with a focus on systems with an identically vanishing first moment. The latter condition produces equations for equilibrium configurations of systems…
We study stochastic second-order methods for solving general non-convex optimization problems. We propose using a special version of momentum to stabilize the stochastic gradient and Hessian estimates in Newton's method. We show that…
We describe methods for proving bounds on infinite-time averages in differential dynamical systems. The methods rely on the construction of nonnegative polynomials with certain properties, similarly to the way nonlinear stability can be…
Moment-sum-of-squares hierarchies of semidefinite programs can be used to approximate the volume of a given compact basic semialgebraic set K. The idea consists of approximating from above the indicator function of K with a sequence of…
The generalized moment problem (GMP) is an infinite dimensional linear problem over the cone of finite nonnegative Borel measures. When a GMP instance involves finitely many polynomial moment constraints, moment/sum-of-squares hierarchies…
We construct least squares formulations of PDEs with inhomogeneous essential boundary conditions, where boundary residuals are not measured in unpractical fractional Sobolev norms, but which formulations nevertheless are shown to yield a…
In this article, we study the regularity of solutions to inhomogeneous time-fractional evolution equations involving anisotropic non-local operators in mixed-norm Sobolev spaces of variable order, with non-trivial initial conditions. The…
In this paper, we introduce a new class of nonsmooth convex functions called SOS-convex semialgebraic functions extending the recently proposed notion of SOS-convex polynomials. This class of nonsmooth convex functions covers many common…
This paper studies the matrix Moment-SOS hierarchy for solving polynomial matrix optimization. Our first result is to show the finite convergence of this hierarchy, if the nondegeneracy condition, strict complementarity condition and second…
Sum-of-squares (SOS) optimization provides a computationally tractable framework for certifying polynomial nonnegativity. If the considered problem is convex, the SOS problem can be transcribed into and solved by semi-definite programs.…
We study the moment space corresponding to matrix measures on the unit circle. Moment points are characterized by non-negative definiteness of block Toeplitz matrices. This characterization is used to derive an explicit representation of…