Exploiting sparsity in semidefinite programming via matrix completion. I: General framework (Q2706347)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1578969
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exploiting sparsity in semidefinite programming via matrix completion. I: General framework |
scientific article; zbMATH DE number 1578969 |
Statements
19 March 2001
0 references
semidefinite programming
0 references
primal-dual interior-point method
0 references
matrix completion problem
0 references
chordal graph
0 references
Exploiting sparsity in semidefinite programming via matrix completion. I: General framework (English)
0 references
0.9730972051620485
0 references
0.9730972051620485
0 references
0.874777615070343
0 references
0.8690574169158936
0 references
0.8602092266082764
0 references
