On Linear and Semidefinite Programming Relaxations for Hypergraph Matching.
Yuk Hei ChanLap Chi LauPublished in: SODA (2010)
Keyphrases
- semidefinite
- semidefinite programming
- linear programming
- interior point methods
- primal dual
- quadratically constrained quadratic
- kernel matrix
- higher order
- symmetric matrix
- quadratic function
- np hard
- maximum margin
- special case
- machine learning
- least squares
- input data
- high order
- dynamic programming
- convex sets
- lower bound
- feature extraction
- linear matrix inequality