On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems.
Etienne de KlerkMonique LaurentPublished in: SIAM J. Optim. (2011)
Keyphrases
- semidefinite
- semidefinite programming
- positive semidefinite
- optimization problems
- evolutionary algorithm
- linear programming
- interior point methods
- convex relaxation
- optimization methods
- kernel matrix
- objective function
- primal dual
- maximum margin
- quadratically constrained quadratic
- linear program
- multistage
- image restoration
- image classification
- least squares
- computational complexity