Chordal sparsity, decomposing SDPs and the Lyapunov equation
Analysis questions in control theory are often formulated as Linear Matrix Inequalities and solved using convex optimisation algorithms. For large LMIs it is important to exploit structure and sparsity within the problem in order to solve the associated Semidefinite Programs efficiently. In this pap...
| Main Authors: | , |
|---|---|
| Format: | Conference item |
| Published: |
Institute of Electrical and Electronics Engineers Inc.
2014
|