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...
Autori principali: | Zheng, Y, Fantuzzi, G, Papachristodoulou, A |
---|---|
Natura: | Journal article |
Lingua: | English |
Pubblicazione: |
Elsevier
2021
|
Documenti analoghi
-
Chordal decomposition in operator-splitting methods for sparse semidefinite programs
di: Zheng, Y, et al.
Pubblicazione: (2019) -
Fast ADMM for semidefinite programs with chordal sparsity
di: Zheng, Y, et al.
Pubblicazione: (2017) -
Chordal decomposition in rank minimized semidefinite programs with applications to subspace clustering
di: Miller, J, et al.
Pubblicazione: (2020) -
Scalable design of structured controllers using chordal decomposition
di: Zheng, Y, et al.
Pubblicazione: (2017) -
A chordal decomposition approach to scalable design of structured feedback gains over directed graphs
di: Zheng, Y, et al.
Pubblicazione: (2016)