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

> Research article (Journal of Global Optimization, 2015) · cited 16× · AI/ML

**Wikidata**: [openalex:W1196354647](https://www.wikidata.org/wiki/openalex:W1196354647)  
**Source**: https://4ort.xyz/entity/semidefinite-programming-relaxation-methods-for-global-optimization-problems-with-sparse-polynomials-and-unbounded-semia