Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope.
Marianna Eisenberg-NagyMonique LaurentAntonios VarvitsiotisPublished in: J. Comb. Theory, Ser. B (2014)
Keyphrases
- low rank
- semidefinite
- semidefinite programming
- kernel matrix
- convex optimization
- optimal solution
- convex relaxation
- positive semidefinite
- interior point methods
- missing data
- linear combination
- matrix factorization
- convex sets
- singular value decomposition
- high order
- high dimensional data
- semi supervised
- linear programming
- sufficient conditions
- higher dimensional
- np hard
- objective function
- linear program
- data sets
- kernel function
- primal dual
- collaborative filtering
- image segmentation
- machine learning