Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results (Q1411643): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SDPA / rank | |||
Normal rank | |||
Revision as of 12:14, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results |
scientific article |
Statements
Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results (English)
0 references
29 October 2003
0 references
primal-dual interior-point method
0 references
matrix completion problem
0 references
clique tree
0 references
numerical results
0 references
