Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results (Q1411643): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| (6 intermediate revisions by 5 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10107-002-0351-9 / rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SeDuMi / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SDPT3 / rank | |||
Normal rank | |||
| 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.1007/s10107-002-0351-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2146826069 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10107-002-0351-9 / rank | |||
Normal rank | |||
Latest revision as of 19:39, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results |
scientific article |
Statements
Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results (English)
0 references
29 October 2003
0 references
primal-dual interior-point method
0 references
matrix completion problem
0 references
clique tree
0 references
numerical results
0 references
