Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications.
Thai Doan ChuongVaithilingam JeyakumarPublished in: Appl. Math. Comput. (2017)
Keyphrases
- semi infinite
- semidefinite
- quadratically constrained quadratic
- semidefinite programming
- linear program
- convex relaxation
- interior point methods
- optimality conditions
- convex optimization
- semi definite programming
- linear programming
- convex sets
- finite dimensional
- sufficient conditions
- kernel learning
- quadratic program
- semidefinite program
- lower level
- higher dimensional
- np hard
- dynamic programming
- optimal solution
- kernel matrix
- finite number