Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework (Q2706347): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s1052623400366218 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2071143636 / rank | |||
Normal rank | |||
Latest revision as of 08:58, 30 July 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
