Unconstraint global polynomial optimization via Gradient Ideal
From MaRDI portal
Publication:6238958
arXiv1301.5298MaRDI QIDQ6238958FDOQ6238958
Authors: Marta Abril Bucero, Bernard Mourrain, Philippe Trébuchet 
Publication date: 22 January 2013
Abstract: 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.
This page was built for publication: Unconstraint global polynomial optimization via Gradient Ideal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6238958)
