Semidefinite programming relaxations through quadratic reformulation for box-constrained polynomial optimization problems.
Sourour ElloumiAmélie LambertArnaud LazarePublished in: CoDIT (2019)
Keyphrases
- semidefinite programming
- semidefinite
- optimization problems
- symmetric matrix
- positive semidefinite
- linear programming
- quadratically constrained quadratic
- nonlinear programming
- objective function
- evolutionary algorithm
- semi infinite
- interior point methods
- quadratic function
- cost function
- kernel matrix
- primal dual
- optimization methods
- maximum margin
- convex relaxation
- linear program
- optimal solution
- machine learning
- input space
- least squares