中文
相关论文

相关论文: Exact polynomial optimization strengthened with Fr…

200 篇论文

Let $f_1,\dots,f_m$ be polynomials in $n$ variables with coefficients in a finite field $\mathbb{F}_q$. We estimate the number of points $\underline{x}$ in $\mathbb{F}_q^n$ such that each value $f_i(\underline{x})$ is a nonzero square in…

代数几何 · 数学 2024-07-16 Kaloyan Slavov

The problem of characterizing a real polynomial $f$ as a sum of squares of polynomials on a real algebraic variety $V$ dates back to the pioneering work of Hilbert in [Mathematische Annalen 32.3 (1888): 342-350]. In this paper, we…

代数几何 · 数学 2023-03-10 Ngoc Hoang Anh Mai , Victor Magron

Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…

交换代数 · 数学 2019-08-08 John Abbott , Anna Maria Bigatti , Elisa Palezzato , Lorenzo Robbiano

We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…

信息论 · 计算机科学 2022-12-08 C. Sinan Güntürk , Weilin Li

We consider the problem of computing the minimum of a polynomial function g on a basic closed semialgebraic set E in R^n. We present a probabilistic symbolic algorithm to find a finite set of sample points of the subset E^{min} of E where…

代数几何 · 数学 2013-04-23 Gabriela Jeronimo , Daniel Perrucci

Let $\mathbf{K}$ be a field and $\phi$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots,…

符号计算 · 计算机科学 2020-09-03 Jean-Charles Faugère , George Labahn , Mohab Safey El Din , Éric Schost , Thi Xuan Vu

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,…

最优化与控制 · 数学 2008-09-09 Jiawang Nie , Kristian Ranestad , Bernd Sturmfels

We consider the problem of computing critical points of the restriction of a polynomial map to an algebraic variety. This is of first importance since the global minimum of such a map is reached at a critical point. Thus, these points…

符号计算 · 计算机科学 2012-02-02 Jean-Charles Faugère , Mohab Safey El Din , Pierre-Jean Spaenlehauer

Let F be any field. Let p(F) be the characteristic of F if F is not of characteristic zero, and let p(F)=+\infty otherwise. Let A_1,...,A_n be finite nonempty subsets of F, and let $$f(x_1,...,x_n)=a_1x_1^k+...+a_nx_n^k+g(x_1,...,x_n)\in…

数论 · 数学 2008-04-02 Zhi-Wei Sun

Let $f_{1}, \ldots, f_{k}$ be polynomials defining an algebraic set in affine $n$-space over a finite field. Suppose $k>n$. We prove that there exists a system of polynomials $g_{1}, \ldots, g_{n}$, each being a linear combination with…

代数几何 · 数学 2022-04-26 Stefan Barańczuk

We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…

代数几何 · 数学 2011-12-05 Gabriela Jeronimo , Daniel Perrucci , Elias Tsigaridas

We consider the class of polynomial optimization problems $\inf \{f(x):x\in K\}$ for which the quadratic module generated by the polynomials that define $K$ and the polynomial $c-f$ (for some scalar $c$) is Archimedean. For such problems,…

最优化与控制 · 数学 2013-07-05 Vaithilingam Jeyakumar , Jean-Bernard Lasserre , G. Li

We extend the method of Ghasemi and Marshall [SIAM. J. Opt. 22(2) (2012), pp 460-473], to obtain a lower bound $f_{{\rm gp},M}$ for a multivariate polynomial $f(x) \in \mathbb{R}[x]$ of degree $ \le 2d$ in $n$ variables $x = (x_1,...,x_n)$…

最优化与控制 · 数学 2013-12-16 Mehdi Ghasemi , Jean Bernard Lasserre , Murray Marshall

With every real polynomial $f$, we associate a family $\{f_{\epsilon r}\}_{\epsilon, r}$ of real polynomials, in explicit form in terms of $f$ and the parameters $\epsilon>0,r\in N$, and such that $\Vert f-f_{\epsilon r}\Vert_1\to 0$ as…

代数几何 · 数学 2007-05-23 Jean B. Lasserre

We consider the problem of minimizing a linear function over an affine section of the cone of positive semidefinite matrices, with the additional constraint that the feasible matrix has prescribed rank. When the rank constraint is active,…

系统与控制 · 计算机科学 2016-11-22 Simone Naldi

Let $\Sigma(f)$ be critical points of a polynomial $f \in \mathbb{K}[x,y]$ in the plane $\mathbb{K}^2$, where $\mathbb{K}$ is $\mathbb{R}$ or $\mathbb{C}$. Our goal is to study the critical point map $\mathfrak{S}_d$, by sending polynomials…

代数几何 · 数学 2022-06-14 John A. Arredondo , Jesús Muciño-Raymundo

Given a polynomial $f$ and a semi-algebraic set $S$, we provide a symbolic algorithm to find the equations and inequalities defining a semi-algebraic set $Q$ which is identical to the closure of the image of $S$ under $f$, i.e.,…

代数几何 · 数学 2022-10-26 Ngoc Hoang Anh Mai

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…

最优化与控制 · 数学 2021-05-28 Ngoc Hoang Anh Mai , Victor Magron

Let ${\mathcal P}_k$ denote the set of all algebraic polynomials of degree at most $k$ with real coefficients. Let ${\mathcal P}_{n,k}$ be the set of all algebraic polynomials of degree at most $n+k$ having exactly $n+1$ zeros at $0$. Let…

经典分析与常微分方程 · 数学 2018-09-21 Tamás Erdélyi

Let $\mathcal{R} = \mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$ of characteristic 0. Consider $n$ algebraically independent elements $g_1, \dots, g_n$ in $\mathcal{R}$. Let $\mathcal{S}$ denote…

符号计算 · 计算机科学 2025-05-01 Thi Xuan Vu