A Lagrangian relaxation view of linear and semidefinite hierarchies.
Jean B. LasserrePublished in: CDC (2013)
Keyphrases
- semidefinite
- lagrangian relaxation
- semidefinite programming
- linear programming
- integer programming
- column generation
- feasible solution
- dynamic programming
- interior point methods
- lower bound
- branch and bound algorithm
- np hard
- lower and upper bounds
- convex relaxation
- higher dimensional
- sufficient conditions
- convex sets
- optimal solution
- mathematical model
- shortest path
- primal dual
- convex optimization
- linear systems
- constraint programming
- linear program
- feature selection