Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of Saskatchewan

$15,000.00

Positive polynomials and sums of squares

FY 2012-13

Summary
Real algebraic geometry studies geometrical objects arising in connection with the mathematical modeling of the ""real world"", i.e., the mathematical description of physical objects as well as of natural and man-made processes in science and technology. The most basic functions considered in real algebraic geometry are the polynomial functions in n real variables with real coefficients. The domains considered are subsets of real n-space defined by polynomial equations and inequalities. A basic problem is to determine the minimum (or maximum) value of such a function on such a domain. This is a hard problem in general, but various fast algorithms based on semidefinite programming can be used to obtain estimates for the minimum value. The theoretical basis for these algorithms is the close relationship that exists between positive polynomials and sums of squares. The study of the relationship between positive polynomials and sums of squares is an old subject, dating back to work of Hilbert in the late 19th century. Landmarks include Artin's solution of Hilbert's 17th problem in 1927, Krivine's Positivstellensatz in 1964, and Schmuedgen's Positivstellensatz (dealing with the case when the domain in question is compact) in 1991. The main object of the proposed research is to understand this relationship better, and apply this information to understand better how these fast algorithms will perform in practical situations.
Program
Discovery Grants Program - Individual
Location
Saskatchewan, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
7854-2008
Name nom
Marshall, Murray
Department département
Mathematics and Statistics
Organization id
16
Institution établissement
University of Saskatchewan
Province en
Saskatchewan
Province fr
Saskatchewan
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2012
Competition year année de concours
2008
Award amount
15000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
336
Committee name en
Pure & Applied Maths - A
Committee name fr
Maths pures et appliquées - A
Area of application code
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
Research subject code
2908
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Algebra
Research subject fr
algèbre
Partie
5
Nb partie
5
Application title
Positive polynomials and sums of squares
Keyword
NSERC
Application summary
Real algebraic geometry studies geometrical objects arising in connection with the mathematical modeling of the ""real world"", i.e., the mathematical description of physical objects as well as of natural and man-made processes in science and technology. The most basic functions considered in real algebraic geometry are the polynomial functions in n real variables with real coefficients. The domains considered are subsets of real n-space defined by polynomial equations and inequalities. A basic problem is to determine the minimum (or maximum) value of such a function on such a domain. This is a hard problem in general, but various fast algorithms based on semidefinite programming can be used to obtain estimates for the minimum value. The theoretical basis for these algorithms is the close relationship that exists between positive polynomials and sums of squares. The study of the relationship between positive polynomials and sums of squares is an old subject, dating back to work of Hilbert in the late 19th century. Landmarks include Artin's solution of Hilbert's 17th problem in 1927, Krivine's Positivstellensatz in 1964, and Schmuedgen's Positivstellensatz (dealing with the case when the domain in question is compact) in 1991. The main object of the proposed research is to understand this relationship better, and apply this information to understand better how these fast algorithms will perform in practical situations.
University of Saskatchewan - $15,000 Grant (2012-13) | Canada Spends