Home ›
Entities
› academia
› Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
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
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
Summary
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets is a scholarly article[1].
Key Facts
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets's instance of is recorded as scholarly article[2].
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA4ort.xyz Knowledge Graph. (2026). Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets. Retrieved May 24, 2026, from https://4ort.xyz/entity/semidefinite-programming-relaxation-methods-for-global-optimization-problems-with-sparse-polynomials-and-unbounded-semia
MLA“Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/semidefinite-programming-relaxation-methods-for-global-optimization-problems-with-sparse-polynomials-and-unbounded-semia.
BibTeX@misc{4ortxyz_semidefinite-programming-relaxation-methods-for-global-optimization-problems-with-sparse-polynomials-and-unbounded-semia_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets}}, year = {2026}, url = {https://4ort.xyz/entity/semidefinite-programming-relaxation-methods-for-global-optimization-problems-with-sparse-polynomials-and-unbounded-semia}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets — https://4ort.xyz/entity/semidefinite-programming-relaxation-methods-for-global-optimization-problems-with-sparse-polynomials-and-unbounded-semia (retrieved 2026-05-24)
