Related papers: A new look at nonnegativity on closed sets and pol…

We consider the problem of minimizing a polynomial $f$ over the binary hypercube. We show that, for a specific set of polynomials, their binary non-negativity can be checked in a polynomial time via minimum cut algorithms, and we construct…

This note considers the maximal positively invariant set for polynomial discrete time dynamics subject to constraints specified by a basic semialgebraic set. The note utilizes a relatively direct, but apparently overlooked, fact stating…

We introduce the concept of disjunctive sum of squares for certifying nonnegativity of polynomials. Unlike the popular sum of squares approach where nonnegativity is certified by a single algebraic identity, the disjunctive sum of squares…

One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomials that are sums of squares of polynomials and satisfy some…

A classical theorem proved in 1942 by I.J. Schoenberg describes all real-valued functions that preserve positivity when applied entrywise to positive semidefinite matrices of arbitrary size; such functions are necessarily analytic with…

The positive semidefinite rank of a convex body $C$ is the size of its smallest positive semidefinite formulation. We show that the positive semidefinite rank of any convex body $C$ is at least $\sqrt{\log d}$ where $d$ is the smallest…

For any closed $K\subseteq\mathbb{R}^n$, in [P.\ J.\ di\,Dio, K.\ Schm\"udgen: $K$-Positivity Preserver and their Generators, SIAM J.\ Appl.\ Algebra Geom.\ 9 (2025), 794--824] all $K$-positivity preserver have been characterized, i.e., all…

Lorentzian and completely log-concave polynomials have recently emerged as a unifying framework for negative dependence, log-concavity, and convexity in combinatorics and probability. We extend this theory to variational analysis and…

Let $P$ be a finite simplicial comple with underlying space (union of simplices in $P$) $|P|$. Let $Q$ be a subcomplex of $P$. Let $a \geq 0$. Then there exists $K < \infty$, \emph{depending only on $a$ and $Q$,} with the following…

For $1\le t < \infty$, a compact subset $K\subset\mathbb C$, and a finite positive measure $\mu$ supported on $K$, $R^t(K, \mu)$ denotes the closure in $L^t(\mu)$ of rational functions with poles off $K$. Let $\text{abpe}(R^t(K, \mu))$…

We consider functions $f(v)=\min_{A\in K}{Av}$ and $g(v)=\max_{A\in K}{Av}$, where $K$ is a finite set of nonnegative matrices and by "min" and "max" we mean coordinate-wise minimum and maximum. We transfer known results about properties of…

In this paper we prove that if $f$ is a self-mapping of a nonempty subset $K$ of a normed space $X$ that satisfies some mild conditions, then the minimal displacement of large iterations $f^n$ always dominates that of $f$ along certain…

We propose a new algorithm to solve optimization problems of the form $\min f(X)$ for a smooth function $f$ under the constraints that $X$ is positive semidefinite and the diagonal blocks of $X$ are small identity matrices. Such problems…

Let $K_f$ be a closed semi-algebraic set in $\dR^d$ such that there exist bounded real polynomials $h_1,{...},h_n$ on $K_f$. It is proved that the moment problem for $K_f$ is solvable provided it is for all sets $K_f\cap C_\lambda$, where…

The main goal of this work is to determine which entire functions preserve nonnegativity of matrices of a fixed order $n$ -- i.e., to characterize entire functions $f$ with the property that $f(A)$ is entrywise nonnegative for every…

This paper establishes new Positivstellens\"atze for polynomials that are positive on sets defined by polynomial matrix inequalities (PMIs). We extend the classical Handelman and Krivine-Stengle theorems from the scalar inequality setting…

We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy, which has…

We deal with non negative functions satisfying \[ \left\{ \begin{array}{ll} (-\Delta)^s u_s=0 & \mathrm{in}\quad C, u_s=0 & \mathrm{in}\quad \mathbb{R}^n\setminus C, \end{array}\right. \] where $s\in(0,1)$ and $C$ is a given cone on…

Many problems of theoretical and practical interest involve finding an optimum over a family of convex functions. For instance, finding the projection on the convex functions in $H^k(\Omega)$, and optimizing functionals arising from some…

We provide a new degree bound on the weighted sum-of-squares (SOS) polynomials for Putinar-Vasilescu's Positivstellensatz. This leads to another Positivstellensatz saying that if $f$ is a polynomial of degree at most $2 d_f$ nonnegative on…