A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations.
Samuel BurerDieter VandenbusschePublished in: Math. Program. (2008)
Keyphrases
- semidefinite
- branch and bound algorithm
- quadratic programming
- interior point methods
- linear programming
- semidefinite programming
- lower bound
- optimal solution
- np hard
- convex optimization
- branch and bound
- objective function
- upper bound
- linear program
- convex relaxation
- ls svm
- combinatorial optimization
- sufficient conditions
- support vector machine
- higher dimensional
- primal dual
- convex sets
- finite number
- column generation
- nearest neighbor
- semi supervised