A hierarchy of semidefinite relaxations for completely positive tensor optimization problems.
Anwa ZhouJinyan FanPublished in: J. Glob. Optim. (2019)
Keyphrases
- semidefinite
- optimization problems
- semidefinite programming
- evolutionary algorithm
- convex relaxation
- sufficient conditions
- cost function
- optimization methods
- higher order
- metaheuristic
- high order
- interior point methods
- higher dimensional
- objective function
- convex optimization
- convex sets
- special case
- dimensionality reduction
- markov random field