Burer-Monteiro ADMM for Large-scale Diagonally Constrained SDPs

We propose a bilinear decomposition for the Burer-Monteiro method for semidefinite programming and combine it with the Alternating Direction Method of Multipli-ers. Bilinear decomposition reduces the degree of the augmented Lagrangian from four to two, which makes each of the sub-problems a quadrati...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2022 European Control Conference (ECC) S. 66 - 71
Hauptverfasser: Chen, Yuwen, Goulart, Paul
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: EUCA 12.07.2022
Schlagworte:
Computational efficiency
Convex functions
Europe
Quadratic programming
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We propose a bilinear decomposition for the Burer-Monteiro method for semidefinite programming and combine it with the Alternating Direction Method of Multipli-ers. Bilinear decomposition reduces the degree of the augmented Lagrangian from four to two, which makes each of the sub-problems a quadratic programming and hence computationally efficient. Our approach is able to solve a class of large-scale SDPs with diagonal constraints. We prove that our ADMM algorithm converges globally to the set of first-order stationary points, and show empirically that the algorithm returns a globally optimal solution for diagonally constrained SDPs.
DOI:10.23919/ECC55457.2022.9838160