Semidefinite relaxations for optimization problems over rotation matrices.
James SaundersonPablo A. ParriloAlan S. WillskyPublished in: CDC (2014)
Keyphrases
- singular value decomposition
- semidefinite
- optimization problems
- semidefinite programming
- evolutionary algorithm
- positive semidefinite
- convex relaxation
- sufficient conditions
- interior point methods
- objective function
- linear complementarity problem
- cost function
- higher dimensional
- metaheuristic
- optimization methods
- convex sets
- convex optimization
- primal dual
- linear programming
- dynamic programming
- support vector