Lower bounds on the global minimum of a polynomial
arXiv:1209.3049 · doi:10.1007/s10589-013-9596-x
Abstract
We extend the method of Ghasemi and Marshall [SIAM. J. Opt. 22(2) (2012), pp 460-473], to obtain a lower bound for a multivariate polynomial of degree in variables on the closed ball , computable by geometric programming, for any real . We compare this bound with the (global) lower bound obtained by Ghasemi and Marshall, and also with the hierarchy of lower bounds, computable by semidefinite programming, obtained by Lasserre [SIAM J. Opt. 11(3) (2001) pp 796-816]. Our computations show that the bound improves on the bound and that the computation of , like that of , can be carried out quickly and easily for polynomials having of large number of variables and/or large degree, assuming a reasonable sparsity of coefficients, cases where the corresponding computation using semidefinite programming breaks down.
References in corpus (1)
Cited by in corpus (4)
- Newton Polytopes and Relative Entropy Optimization
- Lower Bounds for a Polynomial on a basic closed semialgebraic set using geometric programming
- A Perturbed Sums of Squares Theorem for Polynomial Optimization and its Applications
- A Tensor Analogy of Yuan's Theorem of the Alternative and Polynomial Optimization with Sign structure