• Course code:63828C
  • Credits:5
  • Semester: summer
  • Contents

Optimization Methods for Large Networks

In this course, we’ll study the theory behind the polynomial optimization which encompasses many NP-hard non-convex problems with applications in machine learning, statistics, control theory, quantum information theory,... We will focus on the so called Lasserre type hierarchy schemes which exploit certificates of positivity of polynomials and apply them on some concrete problems such as optimal power flow in a network, graph partitioning problems, global optimization of polynomials.

  • Study programmes
  • Distribution of hours per semester
30
hours
lectures
15
hours
tutorials
15
hours
tutorials
  • Professor
Instructor
Room:R3.14 - Kabinet
Course Organiser
Room:R3.15 - Kabinet
Course Organiser
Room:R3.16 - Kabinet