Supermodularity and valid inequalities for quadratic optimization with indicators.
Alper AtamtürkAndres GomezPublished in: CoRR (2020)
Keyphrases
- quadratic optimization
- valid inequalities
- interior point methods
- primal dual
- linear programming
- integer programming
- traveling salesman problem
- mixed integer programming
- lower and upper bounds
- mixed integer
- cutting plane
- feasible solution
- column generation
- integer program
- convex hull
- linear program
- convex optimization
- convergence rate
- semidefinite programming
- lower bound
- lagrangian relaxation
- continuous variables
- quadratic programming
- support vector machine
- learning algorithm
- facet defining
- tabu search