http://dx.doi.org/10.4153/CJM-2009-010-4
Canad. J. Math. 61(2009), 205-221
Published:2009-02-01 Printed: Feb 2009
Features coming soon:
Citations (via CrossRef)
Tools:
Search Google Scholar:
Abstract
Natural sufficient conditions for a polynomial to have a local minimum
at a point are considered. These conditions tend to hold with
probability $1$. It is shown that polynomials satisfying these
conditions at each minimum point have nice presentations in terms of
sums of squares. Applications are given to optimization on a compact
set and also to global optimization. In many cases, there are degree
bounds for such presentations. These bounds are of theoretical
interest, but they appear to be too large to be of much practical use
at present. In the final section, other more concrete degree bounds
are obtained which ensure at least that the feasible set of solutions
is not empty.
© Canadian Mathematical Society, 2013
|