Related papers: Solving moment and polynomial optimization problem…
In this paper, we study some optimization problems in uniformly convex and uniformly smooth Bochner spaces. We consider four cases of the underlying subsets: closed and convex subsets, closed and convex cones, closed subspaces and closed…
This paper studies generalized truncated moment problems with unbounded sets. First, we study geometric properties of the truncated moment cone and its dual cone of nonnegative polynomials. By the technique of homogenization, we give 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…
We introduce novel polyhedral approximation hierarchies for the cone of nonnegative forms on the unit sphere in $\mathbb{R}^n$ and for its (dual) cone of moments. We prove computable quantitative bounds on the speed of convergence of such…
We study an optimization problem in which the objective is given as a sum of logarithmic-polynomial functions. This formulation is motivated by statistical estimation principles such as maximum likelihood estimation, and by loss functions…
This paper considers polynomial optimization with unbounded sets. We give a homogenization formulation and propose a hierarchy of Moment-SOS relaxations to solve it. Under the assumptions that the feasible set is closed at infinity and the…
A broad class of possibly non-unique generalized kinetic solutions to hyperbolic-parabolic PDEs is introduced. Optimal regularity estimates in time and space for such solutions to nonlocal, and spatially inhomogeneous variants of the porous…
Regularity estimates in time and space for solutions to the porous medium equation are shown in the scale of Sobolev spaces. In addition, higher spatial regularity for powers of the solutions is obtained. Scaling arguments indicate that…
In this article, we use the monotonic optimization approach to propose an outcome-space outer approximation by copolyblocks for solving strictly quasiconvex multiobjective programming problems and especially in the case that the objective…
The standard moment-sum-of-squares (SOS) hierarchy is a powerful method for solving global polynomial optimization problems. However, its convergence relies on Putinar's Positivstellensatz, which requires the feasible set to satisfy the…
We obtain an improved Sobolev inequality in H^s spaces involving Morrey norms. This refinement yields a direct proof of the existence of optimizers and the compactness up to symmetry of optimizing sequences for the usual Sobolev embedding.…
Sobolev embeddings, of arbitrary order, are considered into function spaces on domains of $\mathbb R^n$ endowed with measures whose decay on balls is dominated by a power $d$ of their radius. Norms in arbitrary rearrangement-invariant…
We obtain polynomial bounds on the growth in time of Sobolev norm of solutions to the cubic defocusing nonlinear Schrodinger equation on two dimensional product space. We also give the angular improved bilinear Strichartz estimates for…
We are concerned with the non-stationary Stokes system with non-homogeneous external force and non-zero initial data in ${\mathbb R}^n_+ \times (0,T)$. We obtain new estimates of solutions including pressure in terms of mixed anisotropic…
Handling an infinite number of inequality constraints in infinite-dimensional spaces occurs in many fields, from global optimization to optimal transport. These problems have been tackled individually in several previous articles through…
This paper proposes a real moment-HSOS hierarchy for complex polynomial optimization problems with real coefficients. We show that this hierarchy provides the same sequence of lower bounds as the complex analogue, yet is much cheaper to…
We consider the global minimization of smooth functions based solely on function evaluations. Algorithms that achieve the optimal number of function evaluations for a given precision level typically rely on explicitly constructing an…
We study continuous quadratic submodular minimization with bounds and propose a polynomially sized semidefinite relaxation, which is provably tight for dimension $n \le 3$ and empirically tight for larger $n$. We apply the relaxation to two…
Moment problems and orthogonal polynomials, both meant in a single real variable, belong to the oldest problems in Classical Analysis. They have been developing for over a century in two parallel, mostly independent streams. During the last…
In this paper, we present a branch and bound algorithm for extracting approximate solutions to Global Polynomial Optimization (GPO) problems with bounded feasible sets. The algorithm is based on a combination of SOS/Moment relaxations and…