Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion |
scientific article |
Statements
Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (English)
0 references
2 July 2021
0 references
principal submatrix, clique tree conversion, interior-point method
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
