Chordal and factor-width decompositions for scalable semidefinite and polynomial optimization
Chordal and factor-width decomposition methods for semidefinite programming and polynomial optimization have recently enabled the analysis and control of large-scale linear systems and medium-scale nonlinear systems. Chordal decomposition exploits the sparsity of semidefinite matrices in a semidefin...
Hauptverfasser: | Zheng, Y, Fantuzzi, G, Papachristodoulou, A |
---|---|
Format: | Journal article |
Sprache: | English |
Veröffentlicht: |
Elsevier
2021
|
Ähnliche Einträge
-
Chordal decomposition in operator-splitting methods for sparse semidefinite programs
von: Zheng, Y, et al.
Veröffentlicht: (2019) -
Fast ADMM for semidefinite programs with chordal sparsity
von: Zheng, Y, et al.
Veröffentlicht: (2017) -
Chordal decomposition in rank minimized semidefinite programs with applications to subspace clustering
von: Miller, J, et al.
Veröffentlicht: (2020) -
Scalable design of structured controllers using chordal decomposition
von: Zheng, Y, et al.
Veröffentlicht: (2017) -
A chordal decomposition approach to scalable design of structured feedback gains over directed graphs
von: Zheng, Y, et al.
Veröffentlicht: (2016)