Semidefinite relaxations of chance constrained algebraic problems.
Ashkan M. JasourConstantino LagoaPublished in: CDC (2012)
Keyphrases
- semidefinite
- semidefinite programming
- convex relaxation
- chance constrained
- robust optimization
- linear programming
- np hard
- higher dimensional
- solving problems
- lower bound
- globally optimal
- convex sets
- sufficient conditions
- optimization problems
- optimal solution
- convex optimization
- learning tasks
- interior point methods