University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Semidefinite Programming and its Feasible Sets I

  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

Semidefinite Programming and its Feasible Sets I

Download to your calendar using vCal

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

Polynomial Optimisation

In this lecture series I will first give a brief introduction to semidefinite programming and some of its applications. I will then focus on the class of feasible sets for such problems, so-called spectrahedra, and their linear projections. These sets are generalizations of polyhedra. Although there exists an exact definition, we so far do not have a satisfactory and easy-to-check characterization for them. The methods used in finding such characterizations come from convexity theory, optimization, algebra, algebraic geometry and functional analysis. This makes the area an exciting field of research, with many recent results, and many interesting results still to come.

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

Average on weekdays: 8935.74886364 kWh LR5, Department of Engineering / Online (Zoom link: https://us06web.zoom.us/j/87986687566?pwd=MGJScmMwd2lwT0tVMHNmWmxSa05XZz09) Average on weekdays: 8887.24770642 kWh

Other talks

TBC Shining a light on the origin of supermassive black holes with cosmological simulations A Data-Centric Approach to AI Adaptation and Alignment Afternoon Break Laser tomography for wide area gas emission spatio-temporal reconstruction The organisational management of traumatic stress
 

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