Hostname: page-component-7b7567c8c-p67k6 Total loading time: 0 Render date: 2026-11-19T21:20:47.160Z Has data issue: false hasContentIssue false

Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization

Published online by Cambridge University Press:  20 November 2018

M. Marshall*
Affiliation:
Department of Mathematics and Statistics, University of Saskatchewan, Saskatoon, SK, S7N 5E6, marshall@snoopy.usask.ca
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 2009