Finding graph embeddings by incremental low-rank semidefinite programming (Q3458829)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding graph embeddings by incremental low-rank semidefinite programming |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding graph embeddings by incremental low-rank semidefinite programming |
scientific article |
Statements
Finding graph embeddings by incremental low-rank semidefinite programming (English)
0 references
28 December 2015
0 references
graph embedding
0 references
dimensionality reduction
0 references
maximum variance unfolding
0 references
semidefinite programming
0 references
concave quadratic programming
0 references
augmented Lagrangian methods
0 references
interior-point methods
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
