Algorithm 950: Ncpol2sdpa - Sparse Semidefinite Programming Relaxations for Polynomial Optimization Problems of Noncommuting Variables.
Peter WittekPublished in: ACM Trans. Math. Softw. (2015)
Keyphrases
- semidefinite programming
- linear programming
- cost function
- computational complexity
- objective function
- learning algorithm
- interior point methods
- optimization problems
- dynamic programming
- np hard
- primal dual
- optimal solution
- improved algorithm
- worst case
- convergence rate
- least squares
- feature extraction
- machine learning