Chordal Sparsity versus Arrow Sparsity: Decomposition of Matrix Inequalities with Application in Topology Optimization

Add to your list(s) Download to your calendar using vCal

• Michal Kocvara
• Thursday 03 November 2016, 12:00-13:00
• University House, room 108.

If you have a question about this talk, please contact Sergey Sergeev.

We will present two approaches to the decomposition of a large matrix inequality into several smaller ones with the goal to efficiently use existing SDP solvers. The approaches will be demonstrated on an SDP problem arising in topology optimization of mechanical structures. The first, well-known, one is based on the decomposition of chordal graphs. The second one uses the structure of the underlying PDE and its discretization. We will show that the second approach can be considered a sparse low-rank version of the first one and that it leads to significantly more efficient solution.

This talk is part of the Optimisation and Numerical Analysis Seminars series.

This talk is included in these lists:

• Optimisation and Numerical Analysis Seminars
• School of Mathematics events
• University House, room 108

Note that ex-directory lists are not shown.