Mathematical Complexity Reduction - Otto-von-Guericke-University Magdeburg

 
 
 
 
 
 
 
 

Compact Course: Polynomial Optimization

Information

The course will take place from Wednesday July 22nd to Tuesday July 28th and will be given by Maximilian Merkert. Details on the schedule, how to register and participate will follow soon.

Abstract

The topic of this compact course is optimizing a polynomial function over a feasible region defined by polynomial equations and inequalities (i.e., a semi-algebraic set). This setting allows to model a wide range of problems from various applications, but is very challenging to solve even for very restrictive special cases. The course will cover theory on polynomial optimization, which is closely linked to real algebra, as well as practical solution methods, which you can try out during hands-on exercise sessions. Topics include: Sum-of-Squares (SOS) Polynomials, Semidefinite Optimization Problems (SDPs), Positivstellensätze, Conic Duality, and Interior-Point Methods for SDPs. This is the second iteration of this compact course. The first one was taught by Gennadiy as Part 2 of a two-week course on optimization in summer 2017.