English
Related papers

Related papers: A Positivstellensatz for Conditional SAGE Signomia…

200 papers

We prove the existence of quadratic polynomials having a Julia set with positive Lebesgue measure in three cases: the presence of a Cremer fixed point, the presence of a Siegel disk, the presence of infinitely many (satellite)…

Dynamical Systems · Mathematics 2008-02-05 Xavier Buff , Arnaud Cheritat

This paper investigates the minimization of the expectation of piecewise polynomial loss functions over Wasserstein balls. This optimization problem often appears as a key sub-problem of distributionally robust optimization problems. We…

Optimization and Control · Mathematics 2026-02-25 N. D. Dizon , Q. Y. Huang , T. D. Chuong , G. Li , V. Jeyakumar

In the paper, the martingales and super-martingales relative to a convex set of equivalent measures are systematically studied. The notion of local regular super-martingale relative to a convex set of equivalent measures is introduced and…

Statistical Finance · Quantitative Finance 2018-06-15 Nicholas S. Gonchar

Results on matrix canonical forms are used to give a complete description of the higher rank numerical range of matrices arising from the study of quantum error correction. It is shown that the set can be obtained as the intersection of…

Functional Analysis · Mathematics 2011-02-10 Chi-Kwong Li , Nung-Sing Sze

We show that for any $t>1$, the set of unconditional convex bodies in $\mathbb{R}^n$ contains a $t$-separated subset of cardinality at least $\exp \exp (C(t) n)$. This implies that there exists an unconditional convex body in $\mathbb{R}^n$…

Metric Geometry · Mathematics 2015-08-21 Mark Rudelson

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…

Optimization and Control · Mathematics 2017-12-06 Hamza Fawzi , Mohab Safey El Din

A real symmetric matrix (resp., tensor) is said to be copositive if the associated quadratic (resp., homogeneous) form is greater than or equal to zero over the nonnegative orthant. The problem of detecting their copositivity is NP-hard.…

Optimization and Control · Mathematics 2017-11-13 Jiawang Nie , Zi Yang , Xinzhen Zhang

We prove that the F-signature of an affine semigroup ring of positive characteristic is always a rational number, and describe a method for computing this number. We use this method to determine the F-signature of Segre products of…

Commutative Algebra · Mathematics 2007-05-23 Anurag K. Singh

We consider a new hierarchy of semidefinite relaxations for the general polynomial optimization problem $(P):\:f^{\ast}=\min \{\,f(x):x\in K\,\}$ on a compact basic semi-algebraic set $K\subset\R^n$. This hierarchy combines some advantages…

Optimization and Control · Mathematics 2015-06-29 Jean-Bernard Lasserre , Toh Kim-Chuan , Yang Shouguang

We consider M-estimators and derive supremal-inequalities of exponential-or polynomial type according as a boundedness- or a moment-condition is fulfilled. This enables us to derive rates of r-complete convergence and also to show r-qick…

Statistics Theory · Mathematics 2023-11-30 Dietmar Ferger

Given a compact subset $\Sigma \subset \mathbb{R}$ (or $\mathbb{C}$) with logarithmic capacity greater than zero, we construct an explicit family of probability measures supported on $\Sigma$ such that their closure is all the possible weak…

Number Theory · Mathematics 2024-04-11 Naser Talebizadeh Sardari , Bryce Joseph Orloski

This paper is a survey of plurisubharmonic theory where the usual polynomial ring is replaced by a polynomial ring $\mathcal P^S(\mathbb C^n)$ where the $m$-th degree polynomials have exponents restricted to $mS$, where $S\subseteq \mathbb…

Consider a convex set S defined by a matrix inequality of polynomials or rational functions over a domain. The set S is called semidefinite programming (SDP) representable or just semidefinite representable if it equals the projection of a…

Optimization and Control · Mathematics 2011-03-30 Jiawang Nie

Cutting planes are of crucial importance when solving nonconvex nonlinear programs to global optimality, for example using the spatial branch-and-bound algorithms. In this paper, we discuss the generation of cutting planes for signomial…

Optimization and Control · Mathematics 2024-11-14 Liding Xu , Claudia D'Ambrosio , Leo Liberti , Sonia Haddad Vanier

Let $ X $ be an oriented, closed manifold with $ \dim X \geqslant 2 $. Let $ (Z, \partial Z) $ be an oriented, compact manifold with (possibly empty) smooth boundary and $ \dim Z \geqslant 2 $. In this article, we show that if the…

Differential Geometry · Mathematics 2025-09-30 Jie Xu

We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a family of real polynomials defining regular hypersurfaces that…

Algebraic Geometry · Mathematics 2008-12-18 Gabriela Jeronimo , Daniel Perrucci , Juan Sabia

A matrix is totally positive if all of its minors are positive. This notion of positivity coincides with the type A version of Lusztig's more general total positivity in reductive real-split algebraic groups. Since skew-symmetric matrices…

Combinatorics · Mathematics 2024-12-24 Jonathan Boretsky , Veronica Calvo Cortes , Yassine El Maazouz

In (Davis and Papp, 2022), the authors introduced the concept of dual certificates of (weighted) sum-of-squares polynomials, which are vectors from the dual cone of weighted sums of squares (WSOS) polynomials that can be interpreted as…

Algebraic Geometry · Mathematics 2023-08-11 Maria M. Davis , Dávid Papp

We use Reznick's Theorem for positive homogeneous polynomials to prove an elliptic regularity result for representations of enveloping algebras of Lie algebras. This allows us to relax a technical condition for a sum of squares…

Operator Algebras · Mathematics 2011-12-02 J. Nahas

It is proved that every normalized weakly null \sq\ has a sub\sq\ which is convexly unconditional. Further, an Hierarchy of summability methods is introduced and with this we give a complete classification of the complexity of weakly null…

Functional Analysis · Mathematics 2016-09-06 Spiros A. Argyros , S. Merkourakis , A. Tsarpalias