University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Global polynomial optimization with Moment Matrices and Border Basis

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Global polynomial optimization with Moment Matrices and Border Basis

Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani .

Polynomial Optimisation

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.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

No 1 Newnham terrace, Darwin College BSS Formal Seminars Hicks & Mead Rooms, University Centre, Granta Place

Other talks

A novel hereditary encephalopathy in four related Labrador Retrievers associated with a missense variant in the ALDH5A1 gene’ Afternoon Break The Jiangmen Underground Neutrino Observatory (JUNO): Status and First Physics Results Am I a Member? Auditing Private Machine Learning Group Presentation 4 Title to be confirmed
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity