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

27 juin 2022, 09:00 → 30 juin 2022, 16:00 Europe/Paris

Amphithéâtre Schwartz (Institut de Mathématiques)

This short course proposal targets Master or Doctoral students as well as
researchers and engineers who could be interested.

It provides them with a first introduction to certain tools of algebraic geometry and in particular the theory of positive polynomials and its dual, the K-moment problem.

This has many important applications not only in polynomial optimization but
also in many other areas (probability, statistics, dynamical systems, ODEs
and PDEs). These tools have already had an impact in several important
applications (e.g. in optimization, signal processing (Super-Resolution),
Optimal Design in statistics, control, computational geometry) and some
Machine Learning applications (computer vision, tensor decomposition &
completion, dictionary learning, mixture of Gaussians). In addition, noncommutative analogues of such tools are becoming of crucial importance in quantum information.

The course will be a 15  hours module, spread out over 4 days.

Speakers:

• Jean-Bernard Lasserre (LAAS-CNRS)
• Milan Korda (LAAS-CNRS)
• Victor Magron (LAAS-CNRS)

lundi 27 juin

09:30 → 10:30 Basics of Conic Optimization (J.-B. Lasserre) SOS and semidefinite programming (J.-B. Lasserre)

10:30 → 11:00 Coffee break

11:00 → 12:00 Positivity certificates and K-moment problem (J.-B. Lasserre)

12:00 → 14:00 Lunch break

14:00 → 15:00 LP- and SOS-based hierarchy for optimization (J.-B. Lasserre)

15:00 → 15:30 Coffee break

15:30 → 16:30 Comparing LP and SOS-based hierarchies – Finite convergence & Global Optimality conditions (J.-B. Lasserre

mardi 28 juin

09:30 → 10:30 Some applications of the Moment Problem (J.-B. Lasserre)

10:30 → 11:00 Coffee break

11:00 → 12:00 Exploiting correlative sparsity (Victor Magron)

12:00 → 14:00 Lunch break

14:00 → 15:00 Exploiting term sparsity (Victor Magron)

15:00 → 15:30 Coffee break

15:30 → 16:30 Certified optimization: from approximate to exact bounds (Victor Magron)

mercredi 29 juin

09:30 → 10:30 Noncommutative optimization & quantum information (Victor Magron)

10:30 → 11:00 Coffee break

11:00 → 12:00 Exercise session (Victor Magron)

12:00 → 14:00 Lunch break

14:00 → 15:00 Occupation measures for dynamical systems & control (Milan Korda)

15:00 → 15:30 Coffee break

15:30 → 16:30 Trajectory recovery (atomic approximation, Christoffel-Darboux Kernel

jeudi 30 juin

09:30 → 10:30 The region of attraction, invariant sets and extreme values (Milan Korda)

10:30 → 11:00 Coffee break

11:00 → 12:00 Extensions: Partial differential equations, complexity reduction (sparsity, state-space partition) (Milan Korda)

12:00 → 14:00 Lunch break

14:00 → 15:00 Exercises (Milan Korda)