Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity.
Hayato WakiSunyoung KimMasakazu KojimaMasakazu MuramatsuPublished in: SIAM J. Optim. (2006)
Keyphrases
- structured sparsity
- semidefinite program
- convex optimization problems
- convex optimization
- optimization problems
- convex relaxation
- learning problems
- evolutionary algorithm
- interior point methods
- objective function
- distance metric
- multiple kernel learning
- low rank
- total variation
- cost function
- kernel matrix
- primal dual
- optimization methods
- image processing
- kernel learning
- machine learning
- reinforcement learning
- support vector machine
- active learning
- learning tasks
- combinatorial optimization
- linear programming
- denoising