Conic Linear Optimization for Computer-Assisted Proofs
10-16 April 2022
Mathematisches Forschungsinstitut Oberwolfach (MFO),
Germany
Scope
This is a workshop organized by Etienne de Klerk, Didier Henrion, Frank Vallentin and Angelika Wiegele.
Date and venue
The workshop takes place on 10-16 April 2022
at MFO, Oberwolfach, Germany.
Scientific programme
Monday April 11
9.15-10.30.
Monique Laurent (CWI Amsterdam) - Recent developments in polynomial optimization
11.00-12.15.
Victor Magron (LAAS-CNRS Toulouse) - Conic programming for certified polynomial optimization
16.00-16.30.
Elisabeth Gaar (Johannes Kepler Univ Linz) - Towards a Computer-Assisted Proof for a Conjecture from Graph Theory
16.30-17.00.
Georgina Hall (INSEAD Fontainebleau) - Sums of Separable and Quadratic Polynomials
17.30-18.00.
Philippe Moustrou (IMT Univ Toulouse) - Symmetry reduction in AM/GM optimization
Tuesday April 12
9.15-10.30.
Fernando de Oliveira (TU Delft) - The use of flag algebras in proofs
11.00-12.15.
Adrien Taylor (INRIA Paris) - Analysis of worst-case performance of iterative methods via conic optimization
16.00-16.30.
Konstantin Golubev (ETH Zurich) - High Dimensional Hoffman Bound and its application to extremal combinatorics
16.30-17.00.
Renata Sotirov (Tilburg Univ) - The Chvatal-Gomory Procedure for Integer SDPs with Applications in Combinatorial Optimization
17.30-18.00.
Daniel Brosch (Tilburg Univ) - The symmetries of Flag Algebras
Wednesday April 13
9.15-10.30.
David de Laat (TU Delft) - Exploiting symmetry in conic optimization
11.00-11.30.
Mohab Safey El Din (Sorbonne Univ Paris) - Exact algorithm for symmetric polynomial optimization problems and applications.
11.30-12.00.
Andreas Spomer (Univ. Koeln) - The kissing number problem for regular tetrahedra
Thursday April 14
9.15-9.45.
Simone Naldi (Univ Limoges) - On the projective geometry of conic feasibility problems
10.15-10.45.
Felix Kirschner (Tilburg Univ) - Construction of multivariate polynomial approximation kernels via semidefinite programming
11.15-11.45.
Jared Miller (Northeastern Univ Boston) - Bounding distances to unsafe sets
16.00-16.30.
Milan Korda (LAAS-CNRS Toulouse) - Stability and performance verification of dynamical systems controlled by neural networks: algorithms and complexity
16.30-17.00.
Dmitrii Pasechnik (Univ Oxford) - Old and new results in exact computations with group representations: splitting fields
17.30-18.00. Fernando de Oliveira (TU Delft) -
A recursive extension of the theta body to hypergraphs
Friday April 15
9.15-9.45. Maria Dostert (KTH Stockholm) - Semidefinite programming bounds for the average kissing number
10.15-10.45. David de Laat (TU Delft) - Three-point bounds for sphere packing
11.15-11.45. Valentin Dannenberg (Univ Rostock) - Obtaining Rational CP-Certificates via (Generalized) Copositive Matrices