Solving the canonical dual of box- and integer-constrained nonconvex quadratic programs via a deterministic direct search algorithm.
David Yang GaoLayne T. WatsonDavid R. EasterlingWilliam I. ThackerStephen C. BillupsPublished in: Optim. Methods Softw. (2013)
Keyphrases
- quadratic program
- convex optimization
- search algorithm
- primal dual
- linear constraints
- nonlinear programming
- linear program
- objective function
- lagrange multipliers
- quadratic programming
- linear programming
- approximation algorithms
- quadratic optimization problems
- maximum margin
- mixed integer
- optimization problems
- search space
- tabu search
- parameter selection
- decomposition algorithm
- convex sets
- evolutionary algorithm
- training data
- genetic algorithm
- distributed constraint satisfaction problems
- machine learning