Algorithm 883: SparsePOP - A Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems.
Hayato WakiSunyoung KimMasakazu KojimaMasakazu MuramatsuHiroshi SugimotoPublished in: ACM Trans. Math. Softw. (2008)
Keyphrases
- semidefinite programming
- cost function
- objective function
- linear programming
- computational complexity
- primal dual
- convergence rate
- probabilistic model
- optimization problems
- nearest neighbor
- input data
- learning algorithm
- dynamic programming
- optimal solution
- worst case
- graphical models
- np hard
- improved algorithm
- similarity measure
- feature extraction