Ncpol2sdpa - Sparse Semidefinite Programming Relaxations for Polynomial Optimization Problems of Noncommuting Variables.
Peter WittekPublished in: CoRR (2013)
Keyphrases
- semidefinite programming
- semidefinite
- optimization problems
- positive semidefinite
- linear programming
- symmetric matrix
- nonlinear programming
- quadratically constrained quadratic
- evolutionary algorithm
- interior point methods
- objective function
- kernel matrix
- variable selection
- primal dual
- eigenvalue decomposition
- high dimensional
- linear program
- convex sets
- optimization methods
- dynamic programming
- lower bound
- dimensionality reduction
- special case