BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Convex Matrix Inequalities vs Linear Matrix Inequalities - Profess
 or Bill Helton (Mathematics Department\, University of California San Dieg
 o)
DTSTART:20080616T103000Z
DTEND:20080616T113000Z
UID:TALK12419@talks.cam.ac.uk
CONTACT:Dr Guy-Bart Stan
DESCRIPTION:A substantial advance in optimization starting in the 1990's w
 as the realization that problems in many areas\, like linear system contro
 l\, combinatorics\, statistics convert directly to matrix inequalities\, a
 bbreviated MIs\, of which by dent of great cleverness some convert to Line
 ar Matrix Inequalities\, LMI's. A basic question is: which Matrix Inequali
 ties are in fact Linear Matrix Inequalities?\nClearly\, LMIs are convex\, 
 but what about the converse?\n \nHow much more restricted are LMIs than Co
 nvex MIs?\n \nThere is getting to be a reasonable road map to this problem
  with much left to be proved. It involves use and development of technique
 s from  areas  like functional analysis\, real algebraic geometry (polynom
 ial inequalities) and matrix theory. In this talk we give results and conj
 ectures on the answer to the LMI vs convexity question.
LOCATION: Cambridge University Engineering Department\, Lecture Room 4
END:VEVENT
END:VCALENDAR