Related papers: Positivity and optimization for semi-algebraic fun…
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…
We prove that the subdifferential of any semi-algebraic extended-real-valued function on $\R^n$ has $n$-dimensional graph. We discuss consequences for generic semi-algebraic optimization problems.
We utilize the same technique as in [arXiv:2205.04254 (2022)] to provide some representations of polynomials non-negative on a basic semi-algebraic set, defined by polynomial inequalities, under more general conditions. Based on each…
Let $\sigma:\boldsymbol{\Sigma}\to\boldsymbol{\Sigma}$ be the left shift acting on $ \boldsymbol{\Sigma} $, a one-sided Markov subshift on a countable alphabet. Our intention is to guarantee the existence of $\sigma$-invariant Borel…
We define the weak-normalization and the seminormalization of a real algebraic variety relative to its central locus. The study is related to the properties of the rings of continuous rational functions and hereditarily rational functions…
For an arbitrary finite family of semi-algebraic/definable functions, we consider the corresponding inequality constraint set and we study qualification conditions for perturbations of this set. In particular we prove that all positive…
Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noetherity, L\"ob's formula, absence of infinite iteration, absence of divergence and normalisation. The study is based on modal semirings,…
We consider optimization problems with polynomial inequality constraints in non-commuting variables. These non-commuting variables are viewed as bounded operators on a Hilbert space whose dimension is not fixed and the associated polynomial…
We give an alternative proof of a fact that a finite continuous non-decreasing submodular set function on a measurable space can be expressed as a supremum of measures dominated by the function, if there exists a class of sets which is…
The analysis of solutions to algebraic equations is further simplified. A couple of functions and their analytic continuation or root findings are required.
The generalized problem of moments is a conic linear optimization problem over the convex cone of positive Borel measures with given support. It has a large variety of applications, including global optimization of polynomials and rational…
We present a formally verified global optimization framework. Given a semialgebraic or transcendental function $f$ and a compact semialgebraic domain $K$, we use the nonlinear maxplus template approximation algorithm to provide a certified…
A function of positive type can be defined as a positive functional on a convolution algebra of a locally compact group. In the case where the group is abelian, by Bochner's theorem a function of positive type is, up to normalization, the…
We extend and generalize the results of Scheiderer (2006) on the representation of polynomials nonnegative on two-dimensional basic closed semialgebraic sets. Our extension covers some situations where the defining polynomials do not…
We review the algebraic definition of the efficiency of a polarization modulation scheme, which is commonly adopted for solar and stellar spectro-polarimetry applications, and generalize it to allow distinct states of the modulation cycle…
This paper illustrates the relationship between boolean propositional algebra and semirings, presenting some results of partial ordering on boolean propositional algebras, and the necessary conditions to represent a boolean propositional…
Consider the problem of minimizing a lower semi-continuous semi-algebraic function $f \colon \mathbb{R}^n \to \mathbb{R} \cup \{+\infty\}$ on an unbounded closed semi-algebraic set $S \subset \mathbb{R}^n.$ Employing adequate tools of…
We study the growth of polynomials on semialgebraic sets. For this purpose we associate a graded algebra to the set, and address all kinds of questions about finite generation. We show that for a certain class of sets, the algebra is…
A variant of the Archimedean Positivstellensatz is proved which is based on Archimedean semirings or quadratic modules of generating subalgebras. It allows one to obtain representations of strictly positive polynomials on compact…
Using polynomial equations to model combinatorial problems has been a popular tool both in computational combinatorics as well as an approach to proving new theorems. In this paper, we look at several combinatorics problems modeled by…