SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs.
Carlos J. NohraArvind U. RaghunathanNikolaos V. SahinidisPublished in: Math. Program. (2022)
Keyphrases
- global optimization
- mixed integer
- quadratic program
- linear program
- linear programming
- lower bound
- optimal solution
- lot sizing
- feasible solution
- particle swarm optimization
- convex hull
- upper bound
- semidefinite programming
- linear constraints
- semidefinite
- np hard
- quadratic programming
- approximation algorithms
- continuous variables
- maximum margin
- objective function
- special case
- computational complexity
- random variables
- convex optimization
- genetic algorithm
- worst case
- multistage