Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations.
Anureet SaxenaPierre BonamiJon LeePublished in: Math. Program. (2011)
Keyphrases
- convex relaxation
- mixed integer
- convex optimization
- optimization methods
- multistage
- lot sizing
- convex hull
- interior point methods
- linear program
- globally optimal
- multi label
- quadratic program
- feasible solution
- multiple kernel learning
- optimal solution
- continuous variables
- optimization problems
- light field
- simulated annealing
- evolutionary algorithm
- dynamic systems
- optimization method
- graph cuts
- scheduling problem
- np hard