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

临界点与格罗布纳基:非混合情形

Critical Points and Gröbner Bases: the Unmixed Case

Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer

摘要:

本文考虑多项式映射到代数簇的限制的临界点的计算问题。这是第一重要的,因为这样的地图的全球最小值达到一个临界点。因此,这些点自然地出现在非凸多项式优化中,这种优化在广泛的科学应用中(控制理论、化学、经济学等)出现。临界点在最近的有效实代数几何算法中也起着核心作用。实验上,已经观察到Gröbner基算法对于计算这样的点是有效的。因此,最近的软件基于所谓的临界点方法是建立在Gröbner基础上的引擎。设$f_1,..., f_p$是$ \Q[x_1,..., x_n]$中次数为$D$的多项式,$V\subset\C^n$是它们的复簇,$π_1$是投影映射$(x_1,.., x_n)\mapsto x_1$ .通过$f_1,..., f_p$和与$f_1,..., f_p$相关的雅可比矩阵的某些极大子式的消失来定义$π_1$到$V$的限制的临界点。这样的系统是代数结构的:它生成的理想是行列式理想和由$f_1,..., f_p$生成的理想之和。我们提供了第一个复杂性估计的格罗布纳基的计算这样的系统定义的临界点。我们证明了在$f_1,..., f_p$的泛型假设下,其复杂性是关于泛型临界点个数的多项式,即$D^p(D-1)^{n-p}{{n-1}\choose{p-1}}$ .更具体地,在二次情况D=2下,这种Gröbner基计算的复杂度在变量$n$的数量上是多项式的,在$p$上是指数的。我们也给出了支持这些理论结果的实验证据。

英文摘要:

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 appear naturally in non-convex polynomial optimization which occurs in a wide range of scientific applications (control theory, chemistry, economics,...). Critical points also play a central role in recent algorithms of effective real algebraic geometry. Experimentally, it has been observed that Gröbner basis algorithms are efficient to compute such points. Therefore, recent software based on the so-called Critical Point Method are built on Gröbner bases engines. Let $f_1,..., f_p$ be polynomials in $ \Q[x_1,..., x_n]$ of degree $D$, $V\subset\C^n$ be their complex variety and $π_1$ be the projection map $(x_1,.., x_n)\mapsto x_1$. The critical points of the restriction of $π_1$ to $V$ are defined by the vanishing of $f_1,..., f_p$ and some maximal minors of the Jacobian matrix associated to $f_1,..., f_p$. Such a system is algebraically structured: the ideal it generates is the sum of a determinantal ideal and the ideal generated by $f_1,..., f_p$. We provide the first complexity estimates on the computation of Gröbner bases of such systems defining critical points. We prove that under genericity assumptions on $f_1,..., f_p$, the complexity is polynomial in the generic number of critical points, i.e. $D^p(D-1)^{n-p}{{n-1}\choose{p-1}}$. More particularly, in the quadratic case D=2, the complexity of such a Gröbner basis computation is polynomial in the number of variables $n$ and exponential in $p$. We also give experimental evidence supporting these theoretical results.

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

↑