AI 中文总结
研究在坐标平行六面体等集合上找多项式全局最小值问题，采用变量消除算法，虽该方法对低维及低次多项式有实际意义，但理论上适用于任何多项式优化问题，能解决不少实际相关问题。
AI 中文摘要
本文探讨在坐标平行六面体或某些具有简单结构的其他集合上寻找多项式全局最小值的问题。作者使用其此前阐述的多项式优化问题的变量消除算法来解决该问题。需要注意的是，该方法仅对低维问题和次数不太高的多项式具有实际意义。这是因为实施变量消除算法时，确定多项式实根会出现大量替代问题，且这些多项式次数可能很高。尽管理论上变量消除算法适用于任何多项式优化问题，但仍有许多实际相关问题可通过该方法成功解决。
英文摘要
The paper addresses the problem of finding the global minimum of a polynomial on a coordinate parallelepiped or on certain other sets with a simple structure. To solve the problem, the Variable Elimination Algorithm for polynomial optimization problems described in the author's previous works is used. It should be noted that the proposed method can be of practical significance only for problems of low dimensionality and for polynomials of not very high degree. This is due to the fact that, when implementing the VEA, a large number of alternative problems may arise concerning the determination of real roots of polynomials, and these polynomials may have very high degrees. Although, in theory, the Variable Elimination Algorithm is applicable to any polynomial optimization problems, there are often practically relevant problems that can be successfully solved using the proposed method.
Comments22 pages
