BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Claremont Center for the Mathematical Sciences - ECPv5.1.5//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Claremont Center for the Mathematical Sciences
X-ORIGINAL-URL:https://colleges.claremont.edu/ccms
X-WR-CALDESC:Events for Claremont Center for the Mathematical Sciences
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20200308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20201101T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20201014T161500
DTEND;TZID=America/Los_Angeles:20201014T173000
DTSTAMP:20201128T081343
CREATED:20200929T143403Z
LAST-MODIFIED:20200929T143505Z
UID:2062-1602692100-1602696600@colleges.claremont.edu
SUMMARY:Prof. Grigoriy Blekherman
DESCRIPTION:Title: Nonnegative Polynomials and Sums of Squares \nAbstract: Is x4-2x3+7x2-2x+1 nonnegative for any value of x? One way of showing that this holds is by writing x4-2x3+7x2-2x+1=1/2(x2-3x+1)2+1/2(x2+x+1)2. Studying the relationship between non-negativity and sums of squares has a distinguished history in mathematics starting with work of David Hilbert and Hilbert’s 17th problem. I will discuss the history and some modern applications of sums of squares in optimization and combinatorics. \nProf. Blekherman is on the Mathematics faculty at Georgia Tech; he also is an advocate for Georgia Tech’s internationally renown Algorithms\, Combinatorics and Optimization (ACO) graduate program. \n
URL:https://colleges.claremont.edu/ccms/event/prof-grigoriy-blekherman/
CATEGORIES:Colloquium
END:VEVENT
END:VCALENDAR