arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2205.04254math.OCmath.AG
收藏

用Fritz John条件加强的精确多项式optimization

Exact polynomial optimization strengthened with Fritz John conditions

Ngoc Hoang Anh Mai

摘要:

令$f,g_1,\dots,g_m$是变量向量$x=(x_1,\dots,x_n)$中具有实系数的多项式。用$\text{diag}(g)$表示系数为$g=(g_1,\dots,g_m)$的对角矩阵,用$\nabla g$表示$g$的雅可比矩阵。设$C$是由\begin{equation} C=\{x\in\mathbb R^n\,:\,\text{rank}(φ(x))< m\}\quad\text{with}\quadφ:=\begin{bmatrix} \nabla g\\ \text{diag}(g) \end{bmatrix}\,. \end{equation}定义的临界点集。假设$C$在$f$下的像,记为$f(C)$,为空或有限。(Our假设一般成立,因为$C$在具有给定度的$g_1,\dots,g_m$的系数的空间中的Zebraki开集中是空的)。本文给出了一个半定程序返回的值序列,它在由\begin{equation} S:=\{x\in\mathbb R^n\,:\,g_j(x)\ge 0\,,\,j=1,\dots,m\}\,. \end{equation}定义的基本半代数集$x$上收敛于$f$的最小值。因此,我们可以精确地计算$x$中任意实系数多项式在以下集合之一上的最小值:单位球,单位超立方体和单位单形。在一个稍微更一般的假设下,我们将这个结果推广到具有非空内部的基本凸半代数集上的任何多项式的最小化,并且由凹多项式的不等式定义。

英文摘要:

Let $f,g_1,\dots,g_m$ be polynomials with real coefficients in a vector of variables $x=(x_1,\dots,x_n)$. Denote by $\text{diag}(g)$ the diagonal matrix with coefficients $g=(g_1,\dots,g_m)$ and denote by $\nabla g$ the Jacobian of $g$. Let $C$ be the set of critical points defined by \begin{equation} C=\{x\in\mathbb R^n\,:\,\text{rank}(φ(x))< m\}\quad\text{with}\quadφ:=\begin{bmatrix} \nabla g\\ \text{diag}(g) \end{bmatrix}\,. \end{equation} Assume that the image of $C$ under $f$, denoted by $f(C)$, is empty or finite. (Our assumption holds generically since $C$ is empty in a Zariski open set in the space of the coefficients of $g_1,\dots,g_m$ with given degrees.) We provide a sequence of values, returned by semidefinite programs, finitely converges to the minimal value attained by $f$ over the basic semi-algebraic set $S$ defined by \begin{equation} S:=\{x\in\mathbb R^n\,:\,g_j(x)\ge 0\,,\,j=1,\dots,m\}\,. \end{equation} Consequently, we can compute exactly the minimal value of any polynomial with real coefficients in $x$ over one of the following sets: the unit ball, the unit hypercube and the unit simplex. Under a slightly more general assumption, we extend this result to the minimization of any polynomial over a basic convex semi-algebraic set that has non-empty interior and is defined by the inequalities of concave polynomials.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑