BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Global polynomial optimization with Moment Matrices and Border Bas
 is - Abril-Bucero\, M (INRIA Sophia Antipolis)
DTSTART:20130718T093000Z
DTEND:20130718T100000Z
UID:TALK46276@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:Optimization appears in many areas of Scientific Computing\, s
 ince the solution of a problem can often be described as the minimum of an
  optimization problem. We describe a new method to compute the global mini
 mum of a real polynomial function and the ideal defining the points which 
 minimize this polynomial function\, assuming that the minimizer ideal is z
 ero-dimensional. Our method is a generalization of Lasserre relaxation met
 hod and stops in a finite number of steps. The proposed algorithm combines
  Border Basis\, Moment Matrices and Semidefinite Programming.In the case w
 here the minimum is reached at a finite number of points\, it provides a b
 order basis of the minimizer ideal. \n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR