Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming.
Kurt M. AnstreicherPublished in: J. Glob. Optim. (2009)
Keyphrases
- quadratically constrained quadratic
- semidefinite programming
- convex optimization
- nonlinear programming
- interior point methods
- linear programming
- primal dual
- semidefinite
- optimality conditions
- kernel matrix
- maximum margin
- low rank
- mixed integer
- semidefinite program
- total variation
- kernel learning
- kernel function
- linear program
- semi infinite
- training data