Parallel Branch and Bound for Multidimensional Scaling with L1 Distances Formulated as Quadratic Programming with Complementarity Constraints.
Nerijus GaliauskasJulius ZilinskasPublished in: 3PGCIC (2013)
Keyphrases
- branch and bound
- quadratic programming
- multidimensional scaling
- lower bound
- euclidean distance
- search algorithm
- linear programming
- upper bound
- column generation
- optimal solution
- search space
- geodesic distance
- combinatorial optimization
- low dimensional
- dimensionality reduction
- support vector machine
- distance function
- vector space
- ls svm
- model selection
- cluster analysis
- distance measure
- support vector
- principal component analysis
- np hard
- kernel pca