On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems.
Alexander EngauMiguel F. AnjosAnthony VannelliPublished in: Optim. Methods Softw. (2012)
Keyphrases
- semidefinite
- interior point methods
- quadratic optimization problems
- cutting plane
- linear program
- integer program
- quadratic programming
- semidefinite programming
- linear programming
- convex programming
- convex optimization
- semi infinite
- mixed integer
- column generation
- primal dual
- quadratically constrained quadratic
- solving problems
- integer programming
- linear programming relaxation
- valid inequalities
- convex relaxation
- computationally intensive
- lower bound
- knapsack problem
- linear systems
- higher dimensional
- feasible solution
- sufficient conditions
- bayesian networks
- mixed integer programming
- kernel matrix
- low rank
- dynamic programming
- semi definite programming
- np hard