Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting.
Jiming PengTao ZhuHezhi LuoKim-Chuan TohPublished in: Comput. Optim. Appl. (2015)
Keyphrases
- semi definite programming
- quadratic assignment problem
- semidefinite
- combinatorial optimization
- convex optimization
- convex relaxation
- kernel matrix
- semidefinite programming
- low rank
- linear programming
- tabu search
- metric learning
- interior point methods
- lower bound
- eigendecomposition
- kernel learning
- semi supervised learning
- simulated annealing
- classification accuracy
- machine learning
- singular value decomposition
- pairwise constraints
- linear programming relaxation
- genetic algorithm