Related papers: Finding best possible constant for a polynomial in…
The goal of this paper is to provide computational tools able to find a solution of a system of polynomial inequalities. The set of inequalities is reformulated as a system of polynomial equations. Three different methods, two of which…
We present a numerical algorithm for finding real non-negative solutions to polynomial equations. Our methods are based on the expectation maximization and iterative proportional fitting algorithms, which are used in statistics to find…
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 investigate numerically the optimal constants in Lieb-Thirring inequalities by studying the associated maximization problem. We use a monotonic fixed-point algorithm and a finite element discretization to obtain trial potentials which…
We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial differential equations. The objective is to find the largest…
In the paper we study a special parameter containing algebraic inequality involving sum of reciprocals and product of positive real numbers whose sum is 1. We determine the best values of the parameter using a new optimization argument. In…
Let $A_{p,r}^m(n)$ be the best constant that fulfills the following inequality: for every $m$-homogeneous polynomial $P(z) = \sum_{|\alpha|=m} a_{\alpha} z^{\alpha}$ in $n$ complex variables, $$\big( \sum_{|\alpha|=m} |a_{\alpha}|^{r}…
In this paper, exact rate of decrease of best approximations of non-integer numbers by polynomials with integer coefficients of the growing exponentials is found on a disk in complex plane, on a cube in $\mathbb{R}^d$, and on a ball in…
The intention of this note is two-fold. First, we study integer optimization problems in standard form defined by $A \in\mathbb{Z}^{m\times{}n}$ and present an algorithm to solve such problems in polynomial-time provided that both the…
We present a new algorithm for solving a polynomial program P based on the recent "joint + marginal" approach of the first author for, parametric optimization. The idea is to first consider the variable x1 as a parameter and solve the…
We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…
Our main goal is to explicitly compute the best constant for the Sobolev-type inequality involving the polyharmonic operator obtained in (Analysis and Applications 22, pp. 1417-1446, 2024). To achieve this goal, we also establish both…
We discuss the problem of finding the best measurement strategy for estimating the value of a quantum system parameter. In general the optimum quantum measurement, in the sense that it maximizes the quantum Fisher information and hence…
Many combinatorial optimization problems can be formulated as the search for a subgraph that satisfies certain properties and minimizes the total weight. We assume here that the vertices correspond to points in a metric space and can take…
Let $p(z)$ be a monic polynomial of degree $n$, with complex coefficients, and let $q(z)$ be its monic factor. We prove an asymptotically sharp inequality of the form $\|q\|_{E} \le C^n \|p\|_E$, where $\|\cdot\|_E$ denotes the sup norm on…
A polynomial matrix inequality is a formula asserting that a polynomial matrix is positive semidefinite. Polynomial matrix optimization concerns minimizing the smallest eigenvalue of a symmetric polynomial matrix subject to a tuple of…
Let S_n:=a_1\vp_1+...+a_n\vp_n, where \vp_1,...,\vp_n are independent Rademacher random variables (r.v.'s) and a_1,...,a_n are any real numbers such that a_1^2+...+a_n^2=1. Let Z be a standard normal r.v. It is proved that the best constant…
We compute the best constant in the Khintchine inequality under assumption that the sum of Rademacher random variables is zero.
We describe efficient algorithms to search for cases in which binomial coefficients are equal or almost equal, give a conjecturally complete list of all cases where two binomial coefficients differ by 1, and give some identities for…
We consider the problem of computing the nearest matrix polynomial with a non-trivial Smith Normal Form. We show that computing the Smith form of a matrix polynomial is amenable to numeric computation as an optimization problem.…