On the Slater condition for the SDP relaxations of nonconvex sets.
Levent TunçelPublished in: Oper. Res. Lett. (2001)
Keyphrases
- semidefinite
- linear programming
- convex optimization
- semidefinite programming
- sufficient conditions
- convex relaxation
- lower bound
- objective function
- high dimensional
- evolutionary algorithm
- nonlinear programming
- convex sets
- quadratically constrained quadratic
- semidefinite program
- optimization problems
- np hard
- support vector