Conference item
Fast ADMM for semidefinite programs with chordal sparsity
- Abstract:
-
Many problems in control theory can be formulated as semidefinite programs (SDPs). For large-scale SDPs, it is important to exploit the inherent sparsity to improve scalability. This paper develops efficient first-order methods to solve SDPs with chordal sparsity based on the alternating direction method of multipliers (ADMM). We show that chordal decomposition can be applied to either the primal or the dual standard form of a sparse SDP, resulting in scaled versions of ADMM algorithms with t...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 385.6KB)
-
- Publisher copy:
- 10.23919/ACC.2017.7963462
Authors
Funding
Bibliographic Details
- Publisher:
- IEEE Publisher's website
- Host title:
- Proceedings of the American Control Conference
- Journal:
- Proceedings of the American Control Conference Journal website
- Pages:
- 3335-3340
- Publication date:
- 2017-07-03
- Acceptance date:
- 2017-01-23
- DOI:
- EISSN:
-
2378-5861
- ISSN:
-
0743-1619
- ISBN:
- 9781509045839
Item Description
- Pubs id:
-
pubs:681353
- UUID:
-
uuid:8e7d0453-7d23-4394-ba6c-610ca525fa48
- Local pid:
- pubs:681353
- Source identifiers:
-
681353
- Deposit date:
- 2017-02-27
Terms of use
- Copyright holder:
- AACC
- Copyright date:
- 2017
- Notes:
- Copyright © 2017 AACC. This is the accepted manuscript version of the article. The final version is available online from IEEE at: https://doi.org/10.23919/ACC.2017.7963462
Metrics
If you are the owner of this record, you can report an update to it here: Report update to this record