DMCA
Representation of non-negative polynomials, degree bounds and applications to optimization (2006)
| Citations: | 22 - 2 self |
BibTeX
@TECHREPORT{Marshall06representationof,
author = {M. Marshall},
title = {Representation of non-negative polynomials, degree bounds and applications to optimization },
institution = {},
year = {2006}
}
Share
 |
 |
 |
 |
||
OpenURL
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.
