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: | Mason, R, Papachristodoulou, A |
---|---|
Format: | Conference item |
Published: |
Institute of Electrical and Electronics Engineers Inc.
2014
|
Similar Items
-
Fast ADMM for semidefinite programs with chordal sparsity
by: Zheng, Y, et al.
Published: (2017) -
A clique graph based merging strategy for decomposable SDPs
by: Garstka, M, et al.
Published: (2021) -
A chordal sparsity approach to scalable linear and nonlinear systems analysis
by: Mason, R
Published: (2015) -
Chordal sparsity in control and optimization of large-scale systems
by: Zheng, Y
Published: (2019) -
Scalable design of structured controllers using chordal decomposition
by: Zheng, Y, et al.
Published: (2017)