 |
Scalable Semidefinite Programming
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.
https://hal.telecom-paris.fr/hal-02493338
Contributor : Olivier Fercoq <>
Submitted on : Thursday, February 27, 2020 - 4:50:17 PM
Last modification on : Tuesday, August 4, 2020 - 9:25:33 AM
Contributor : Olivier Fercoq <>
Submitted on : Thursday, February 27, 2020 - 4:50:17 PM
Last modification on : Tuesday, August 4, 2020 - 9:25:33 AM
Links full text
