An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs.
Pham Dinh TaoNam Nguyen CanhLe Thi Hoai AnPublished in: J. Glob. Optim. (2010)
Keyphrases
- quadratic program
- semi definite programming
- convex optimization
- linear program
- linear constraints
- linear programming
- approximation algorithms
- quadratic programming
- objective function
- spectral relaxation
- maximum margin
- lp relaxation
- semidefinite programming
- semidefinite
- mixed integer
- convex relaxation
- kernel learning
- convex programming
- support vector
- parameter selection
- interior point methods
- kernel matrix
- semi supervised