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

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.