Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework (Q2706347): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SDPT3 / rank | |||
Normal rank | |||
Revision as of 20:08, 29 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
