On the Equivalence of SDP Feasibility and a Convex Hull Relaxation for System of Quadratic Equations.
Bahman KalantariPublished in: CoRR (2019)
Keyphrases
- convex hull
- semidefinite
- convex sets
- semidefinite programming
- semi definite programming
- objective function
- mixed integer
- convex relaxation
- convex concave
- mathematical model
- higher dimensional
- computational geometry
- interior point methods
- quadratic program
- convex polyhedra
- continuous relaxation
- spectral relaxation
- feasible solution
- infinite dimensional
- convex optimization
- valid inequalities
- linear equations
- variational inequalities
- training samples
- pairwise
- minimum distance
- linear constraints
- extreme points
- kernel matrix
- simple polygon