The following publications are possibly variants of this publication:
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured SparsityHayato Waki, Sunyoung Kim, Masakazu Kojima, Masakazu Muramatsu. siamjo, 17(1):218-242, 2006. [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]
- 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]