Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results (Q1411643)
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: Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results |
scientific article; zbMATH DE number 1998214
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results |
scientific article; zbMATH DE number 1998214 |
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
0.9730972051620485
0 references
0.8564078211784363
0 references
0.8523033261299133
0 references
0.8502408266067505
0 references
0.8499665260314941
0 references
