Unconstraint global polynomial optimization via Gradient Ideal
Résumé
In this paper, we describe a new method to compute the minimum of a real polynomial function and the ideal defining the points which minimize this polynomial function, assuming that the minimizer ideal is zero-dimensional. Our method is a generalization of Lasserre relaxation method and stops in a finite number of steps. The proposed algorithm combines Border Basis, Moment Matrices and Semidefinite Programming. In the case where the minimum is reached at a finite number of points, it provides a border basis of the minimizer ideal.
Domaines
Géométrie algébrique [math.AG]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...