On linear and semidefinite programming relaxations for hypergraph matching.
Yuk Hei ChanLap Chi LauPublished in: Math. Program. (2012)
Keyphrases
- semidefinite
- semidefinite programming
- linear programming
- interior point methods
- symmetric matrix
- primal dual
- quadratic function
- higher order
- maximum margin
- sufficient conditions
- kernel matrix
- quadratically constrained quadratic
- dynamic programming
- pairwise
- np hard
- linear program
- convex sets
- training data
- linear combination
- markov random field
- special case
- lower bound