BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:CUED Control Group Seminars
SUMMARY:Convex Matrix Inequalities vs Linear Matrix Inequa
lities - Professor Bill Helton (Mathematics Depart
ment\, University of California San Diego)
DTSTART;TZID=Europe/London:20080616T113000
DTEND;TZID=Europe/London:20080616T123000
UID:TALK12419AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/12419
DESCRIPTION:A substantial advance in optimization starting in
the 1990's was the realization that problems in ma
ny areas\, like linear system control\, combinator
ics\, statistics convert directly to matrix inequa
lities\, abbreviated MIs\, of which by dent of gre
at cleverness some convert to Linear Matrix Inequa
lities\, LMI's. A basic question is: which Matrix
Inequalities are in fact Linear Matrix Inequalitie
s?\nClearly\, LMIs are convex\, but what about the
converse?\n \nHow much more restricted are LMIs t
han Convex MIs?\n \nThere is getting to be a reaso
nable road map to this problem with much left to b
e proved. It involves use and development of techn
iques from areas like functional analysis\, real
algebraic geometry (polynomial inequalities) and
matrix theory. In this talk we give results and co
njectures on the answer to the LMI vs convexity qu
estion.
LOCATION: Cambridge University Engineering Department\, Lec
ture Room 4
CONTACT:Dr Guy-Bart Stan
END:VEVENT
END:VCALENDAR