skip to main content


Title: Sparse Semidefinite Programs with Guaranteed Near-Linear Time Complexity via Dualized Clique Tree Conversion
Award ID(s):
1807260
NSF-PAR ID:
10156152
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Mathematical programming
ISSN:
0025-5610
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
No document suggestions found