Tight SDP Relaxations for Cardinality-Constrained Problems.
Angelika WiegeleShudian ZhaoPublished in: OR (2021)
Keyphrases
- constrained problems
- lower bound
- semidefinite
- semidefinite programming
- constraint propagation
- constraint satisfaction
- linear programming
- optimization problems
- convex relaxation
- upper bound
- highly constrained
- semi definite programming
- worst case
- interior point methods
- branch and bound algorithm
- quadratically constrained quadratic
- np hard
- kernel matrix
- constraint satisfaction problems
- stochastic local search
- objective function
- neural network
- arc consistency
- primal dual
- heuristic search
- cost function
- search space
- video sequences
- semidefinite program