Algorithms for computing the global infimum and minimum of a polynomial function

• 来源期刊: 中国科学：数学（英文版）
• 年，卷（期）: 2012,（4）
• 页码范围: 881-891
• 页数: 11页
• 语种: 英文
• DOI: 10.1007/sl1425-011-4326-2

摘要

By catching the so-called strictly critical points,this paper presents an effective algorithm for computing the global infimum of a polynomial function.For a multivariate real polynomial f,the algorithm in this paper is able to decide whether or not the global infimum of f is finite.In the case of f having a finite infimum,the global infimum of f can be accurately coded in the Interval Representation.Another usage of our algorithm to decide whether or not the infimum of f is attained when the global infimum of f is finite.In the design of our algorithm,Wu's well-known method plays an important role.