Deciding reachability of the infimum of a multivariate polynomial


Let <i>f</i> ∈ Q[<i>X</i>_1,...,<i>X<sub>n</sub></i>] be of degree <i>D</i>. Algorithms for solving the unconstrained global optimization problem <i>f</i>*=inf<sub><i>x</i></sub>∈<i>R<sup>n</sup></i> <i>f</i>(<i>x</i>) are of first importance since this problem appears frequently in numerous applications in engineering sciences. This can be tackled by… (More)
DOI: 10.1145/1993886.1993910


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics