Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints.
Lijie BaiJohn E. MitchellJong-Shi PangPublished in: Optim. Lett. (2014)
Keyphrases
- quadratic program
- convex optimization
- convex relaxation
- linear constraints
- mixed integer
- semidefinite
- convex sets
- linear program
- total variation
- globally optimal
- quadratic programming
- approximation algorithms
- linear programming
- multi label
- objective function
- optimization methods
- multiple kernel learning
- multistage
- training data
- feasible solution
- learning tasks
- evolutionary algorithm