Home › Entities › academia › Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity

Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity

Research article (Mathematical Programming Computation, 2017) · cited 70× · AI/ML
academia openalex:W2593062745
Press Enter · cited answer in seconds

Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity

Summary

Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity is a scholarly article[1].

Key Facts

  • Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity's instance of is recorded as scholarly article[2].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

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.

APA 4ort.xyz Knowledge Graph. (2026). Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity. Retrieved May 24, 2026, from https://4ort.xyz/entity/sparse-bsos-a-bounded-degree-sos-hierarchy-for-large-scale-polynomial-optimization-with-sparsity
MLA “Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/sparse-bsos-a-bounded-degree-sos-hierarchy-for-large-scale-polynomial-optimization-with-sparsity.
BibTeX @misc{4ortxyz_sparse-bsos-a-bounded-degree-sos-hierarchy-for-large-scale-polynomial-optimization-with-sparsity_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity}}, year = {2026}, url = {https://4ort.xyz/entity/sparse-bsos-a-bounded-degree-sos-hierarchy-for-large-scale-polynomial-optimization-with-sparsity}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity — https://4ort.xyz/entity/sparse-bsos-a-bounded-degree-sos-hierarchy-for-large-scale-polynomial-optimization-with-sparsity (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/sparse-bsos-a-bounded-degree-sos-hierarchy-for-large-scale-polynomial-optimization-with-sparsity · Last refreshed: