Generating cutting planes for the semidefinite relaxation of quadratic programs.
Agnès GorgeAbdel LisserRiadh ZorgatiPublished in: Comput. Oper. Res. (2015)
Keyphrases
- semidefinite
- cutting plane
- mixed integer
- quadratic program
- interior point methods
- convex relaxation
- convex optimization
- linear program
- semidefinite programming
- quadratic programming
- column generation
- linear programming
- integer programming
- convex sets
- knapsack problem
- lower bound
- integer program
- feasible solution
- convex hull
- higher dimensional
- linear constraints
- sufficient conditions
- primal dual
- objective function
- optimal solution
- lot sizing