Scalable Semidefinite Programming

3 S2A - Signal, Statistique et Apprentissage
LTCI - Laboratoire Traitement et Communication de l'Information
Abstract : Semidefinite programming (SDP) is a powerful framework from convex optimization that has striking potential for data science applications. This paper develops a provably correct algorithm for solving large SDP problems by economizing on both the storage and the arithmetic costs. Numerical evidence shows that the method is effective for a range of applications, including relaxations of MaxCut, abstract phase retrieval, and quadratic assignment. Running on a laptop, the algorithm can handle SDP instances where the matrix variable has over $10^{13}$ entries.
Document type :
Journal articles

https://hal.telecom-paris.fr/hal-02493338
Contributor : Olivier Fercoq Connect in order to contact the contributor
Submitted on : Thursday, February 27, 2020 - 4:50:17 PM
Last modification on : Tuesday, October 19, 2021 - 11:16:16 AM

Citation

Alp yurtsever, Joel A. Tropp, Olivier Fercoq, Madeleine Udell, Volkan Cevher. Scalable Semidefinite Programming. SIAM Journal on Mathematics of Data Science, Society for Industrial and Applied Mathematics, 2021, ⟨10.1137/19M1305045⟩. ⟨hal-02493338⟩

Record views