求基本闭半代数集上多项式函数极小值的概率符号算法
A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set
摘要:
考虑R^n中基本闭半代数集E上多项式函数g的极小值的计算问题。我们提出了一个概率符号算法,以找到一个有限集的样本点的子集E^{min}的E,其中g的最小值达到,如果E^{min}是非空的,并有至少一个紧凑的连通分支。
英文摘要:
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 the minimum of g is attained, provided that E^{min} is non-empty and has at least one compact connected component.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。