A relaxed interior point method for low-rank semidefinite programming problems.
Stefania BellaviaJacek GondzioMargherita PorcelliPublished in: CoRR (2019)
Keyphrases
- semidefinite programming
- interior point methods
- low rank
- kernel matrix
- convex optimization
- convex programming
- primal dual
- semidefinite
- interior point
- linear programming
- matrix factorization
- missing data
- linear programming problems
- linear combination
- singular value decomposition
- kernel methods
- kernel function
- quadratic programming
- feature space
- semi supervised
- high dimensional data
- solving problems
- linear program
- maximum margin
- natural images
- metric learning
- dynamic programming
- high order
- pattern recognition
- optimal solution