Finding graph embeddings by incremental low-rank semidefinite programming.
Seppo PulkkinenPublished in: Optim. Methods Softw. (2015)
Keyphrases
- low rank
- semidefinite programming
- kernel matrix
- high dimensional data
- convex optimization
- trace norm
- positive semidefinite
- missing data
- matrix factorization
- linear combination
- singular value decomposition
- interior point methods
- semidefinite
- primal dual
- high order
- semi supervised
- low dimensional
- interior point
- minimization problems
- dimensionality reduction
- linear programming
- maximum margin
- high dimensional
- feature space
- distance measure
- affinity matrix
- data analysis