Convergent conic linear programming relaxations for cone convex polynomial programs.
Thai Doan ChuongVaithilingam JeyakumarPublished in: Oper. Res. Lett. (2017)
Keyphrases
- linear programming relaxation
- convex sets
- semidefinite
- convex cone
- knapsack problem
- positive semidefinite
- linear programming
- branch and bound
- column generation
- convex optimization
- integer programming
- positive semidefinite matrices
- convex hull
- cutting plane
- feasible solution
- mixed integer programming
- integer program
- lower bound
- valid inequalities
- semidefinite programming
- search algorithm
- reinforcement learning