Spring schoolTopic: Semi-Definite Prgramming and Conic Optimization Speakers: Lucas Letocart (LIPN, Univ. Sorbonne Paris Nord) and Manuel Ruiz (RTE)
Date: June, 10 and 11, 2025.
Summary: This course will focus on basic notions related to convex sets and cones, Positive Semi-Definite matrices, Positive Semi-Definite programming and duality. The resolution algorithm will be addressed (interior points method and clique decomposition method) as well as practical applications like Max Cut and Optimal Power Flow Problems. Other possible conic relaxations will also be addressed like SOCP, moments and Lasserre hierarchy, copositivity, complete positivity and boolean quadratic polytopes.
Tuesday 10 june
Wednesday 11 june
|
