skip to content
 

Global polynomial optimization with Moment Matrices and Border Basis

Presented by: 
M Abril-Bucero INRIA Sophia Antipolis
Date: 
Thursday 18th July 2013 - 10:30 to 11:00
Venue: 
INI Seminar Room 1
Abstract: 
Optimization appears in many areas of Scientific Computing, since 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 minimum of a real polynomial function and the ideal defining the points which minimize this polynomial function, assuming that the minimizer ideal is zero-dimensional. Our method is a generalization of Lasserre relaxation method and stops in a finite number of steps. The proposed algorithm combines Border Basis, Moment Matrices and Semidefinite Programming.In the case where the minimum is reached at a finite number of points, it provides a border basis of the minimizer ideal.
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
Presentation Material: 
University of Cambridge Research Councils UK
    Clay Mathematics Institute The Leverhulme Trust London Mathematical Society Microsoft Research NM Rothschild and Sons