Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10107-020-01516-y / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10107-020-01516-Y / rank | |||
Normal rank | |||
Latest revision as of 20:44, 16 December 2024
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
