Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework (Q2706347): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:03, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework |
scientific article |
Statements
Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework (English)
0 references
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
