Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Vaithilingam Jeyakumar, S. Kim, G. M. Lee, G. Li. Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets. J. Global Optimization, 65(2):175-190, 2016. [doi]

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]

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]

Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization ProblemsVaithilingam Jeyakumar, Jean B. Lasserre, G. Li, T. S. Pham. siamjo, 26(1):753-780, 2016. [doi]

Solving polynomial least squares problems via semidefinite programming relaxationsSunyoung Kim, Masakazu Kojima. jgo, 46(1):1-23, 2010. [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]

runs on WebDSL