Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program.
Marco LocatelliPublished in: Oper. Res. Lett. (2013)
Keyphrases
- semidefinite program
- convex optimization
- convex hull
- quadratically constrained quadratic
- linear transformation
- optimal kernel
- quadratic program
- semidefinite
- kernel matrix
- interior point methods
- learning algorithm
- image processing
- pairwise
- convex sets
- machine learning
- kernel learning
- feature space
- distance metric
- kernel function
- linear combination
- active learning