Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound.
Samuel BurerDieter VandenbusschePublished in: Comput. Optim. Appl. (2009)
Keyphrases
- branch and bound
- quadratic program
- semidefinite
- convex optimization
- convex relaxation
- interior point methods
- combinatorial optimization
- lower bound
- semidefinite programming
- optimal solution
- linear program
- search algorithm
- convex sets
- column generation
- linear programming
- objective function
- linear constraints
- quadratic programming
- upper bound
- search space
- primal dual
- maximum margin
- approximation algorithms
- np hard
- total variation
- low rank
- mixed integer
- sufficient conditions
- higher dimensional
- finite number
- metaheuristic
- optimization problems
- simulated annealing
- machine learning
- support vector machine
- genetic algorithm