Algorithm 883
Published in ACM Transactions on Mathematical Software • Jul 1, 2008
NobleIDNI7P59W92R40S85
Authors:,,
Hayato Waki
Sunyoung Kim
Masakazu Kojima
Abstract
SparsePOP is a Matlab implementation of the sparse semidefinite programming (SDP) relaxation method for approximating a global optimal solution of a polynomial optimization problem (POP) proposed by Waki et al. [2006]. The sparse SDP relaxation exploits a sparse structure of polynomials in POPs when...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!