Solving Euclidean distance matrix completion problems via semidefinite progrmming (Q1294802): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Amir K. Khandani / rank | |||
| Property / author | |||
| Property / author: Amir K. Khandani / 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.1023/a:1008655427845 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2125947724 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:58, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving Euclidean distance matrix completion problems via semidefinite progrmming |
scientific article |
Statements
Solving Euclidean distance matrix completion problems via semidefinite progrmming (English)
0 references
1999
0 references
Euclidean distance matrices
0 references
semidefinite programming
0 references
completion problems
0 references
primal-dual interior-point method
0 references
