Summer school EUR MINT 2022 Moments & Positive Polynomials & their Applications

Contribution List

1. Basics of Conic Optimization (J.-B. Lasserre) SOS and semidefinite programming (J.-B. Lasserre)

6/27/22, 9:30 AM

2. Positivity certificates and K-moment problem (J.-B. Lasserre)

6/27/22, 11:00 AM

3. LP- and SOS-based hierarchy for optimization (J.-B. Lasserre)

6/27/22, 2:00 PM

4. Comparing LP and SOS-based hierarchies – Finite convergence & Global Optimality conditions (J.-B. Lasserre

6/27/22, 3:30 PM

5. Some applications of the Moment Problem (J.-B. Lasserre)

6/28/22, 9:30 AM

6. Exploiting correlative sparsity (Victor Magron)

6/28/22, 11:00 AM

7. Exploiting term sparsity (Victor Magron)

6/28/22, 2:00 PM

8. Certified optimization: from approximate to exact bounds (Victor Magron)

6/28/22, 3:30 PM

9. Noncommutative optimization & quantum information (Victor Magron)

6/29/22, 9:30 AM

10. Exercise session (Victor Magron)

6/29/22, 11:00 AM

11. Occupation measures for dynamical systems & control (Milan Korda)

6/29/22, 2:00 PM

12. Trajectory recovery (atomic approximation, Christoffel-Darboux Kernel

6/29/22, 3:30 PM

13. The region of attraction, invariant sets and extreme values (Milan Korda)

6/30/22, 9:30 AM

14. Extensions: Partial differential equations, complexity reduction (sparsity, state-space partition) (Milan Korda)

6/30/22, 11:00 AM

15. Exercises (Milan Korda)

6/30/22, 2:00 PM