The following publications are possibly variants of this publication:
- Algorithm 883: SparsePOP---A Sparse Semidefinite Programming Relaxation of Polynomial Optimization ProblemsHayato Waki, Sunyoung Kim, Masakazu Kojima, Masakazu Muramatsu, Hiroshi Sugimoto. TOMS, 35(2), 2008. [doi]
- Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization ProblemsSunyoung Kim, Masakazu Kojima, Hayato Waki. siamjo, 15(3):697-719, 2005. [doi]
- An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems Over Symmetric ConesMasakazu Kojima, Masakazu Muramatsu. mp, 110(2):315-336, 2007. [doi]
- Solving polynomial least squares problems via semidefinite programming relaxationsSunyoung Kim, Masakazu Kojima. jgo, 46(1):1-23, 2010. [doi]
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible setsVaithilingam Jeyakumar, S. Kim, G. M. Lee, G. Li. jgo, 65(2):175-190, 2016. [doi]