Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems.
Vaithilingam JeyakumarJean B. LasserreGuoyin LiT. S. PhamPublished in: SIAM J. Optim. (2016)
Keyphrases
- semidefinite programming
- linear programming
- semidefinite
- optimization problems
- positive semidefinite
- nonlinear programming
- objective function
- symmetric matrix
- linear program
- interior point methods
- primal dual
- evolutionary algorithm
- quadratically constrained quadratic
- cost function
- np hard
- kernel matrix
- optimal solution
- maximum margin
- dynamic programming
- hyperplane
- pairwise