Semidefinite Programming and its Feasible Sets II
Add to your list(s)
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, socalled 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 easytocheck 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 exdirectory lists are not shown.
