Moment sum-of-square hierarchies for arrow-type polynomial matrix inequalities

• Date: 3. 4. 2025
• Time: 14:00 - 15:30
• Address:
  Sokolovská 83, Praha
• Room: K1
• Speaker: Marouan Handa

The Arrow Decomposition (AD) technique has demonstrated superior scalability compared to classical chordal decomposition for Linear Matrix Inequalities when the matrix satisfies suitable assumptions. In this talk, we present an extension of the AD method to handle polynomial optimization problems involving Polynomial Matrix Inequalities as constraints, with the solution framework relying on the Lasserre’s moment-sum of squares hierarchies. We finally present the application of AD to topology optimization of frame structures.