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 this page instead for the normal view: Exploiting sparsity in semidefinite programming via matrix completion. I: General framework |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exploiting sparsity in semidefinite programming via matrix completion. I: General framework |
scientific article |
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
