摘要
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.
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.
基金
partially supported by National Natural Science Foundation of China (Grant Nos. 10761006, 11161034)
