Chordal decomposition in rank minimized semidefinite programs with applications to subspace clustering

Conference item

Semidefinite programs (SDPs) often arise in relaxations of some NP-hard problems, and if the solution of the SDP obeys certain rank constraints, the relaxation will be tight. Decomposition methods based on chordal sparsity have already been applied to speed up the solution of sparse SDPs, but methods for dealing with rank constraints are underdeveloped. This paper leverages a minimum rank completion result to decompose the rank constraint on a single large matrix into multiple rank constraints on a set of smaller matrices. The re-weighted heuristic is used as a proxy for rank, and the specific form of the heuristic preserves the sparsity pattern between iterations. Implementations of rank-minimized SDPs through interior-point and first-order algorithms are discussed. The problem of subspace clustering is used to demonstrate the computational improvement of the proposed method.

Authors: Miller, J; Zheng, Y; Roig-Solvas, B; Sznaier, M; Papachristodoulou, A

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: IEEE
• Host title: Proceedings of the IEEE Conference on Decision and Control
• Journal: Proceedings of the IEEE Conference on Decision and Control
• Volume: 2019-December
• Pages: 4916-4921
• Publication date: 2020-03-12
• Acceptance date: 2019-07-01
• Event title: 2019 IEEE 58th Conference on Decision and Control (CDC)
• Event location: Jeju Island, Republic of Korea
• Event website: https://cdc2019.ieeecss.org/
• Event start date: 2019-12-11
• Event end date: 2019-12-13
• DOI: 10.1109/CDC40024.2019.9029620
• EISSN: 2576-2370
• ISSN: 0743-1546
• EISBN: 978-1-7281-1398-2
• ISBN: 978-1-7281-1399-9
• Language: English
• Keywords: FFR