arbiter
JournalsPricingAccount

Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant

Ngoc Hoang Anh Mai et al.

Computational Optimization and Applications2026https://doi.org/10.1007/s10589-026-00782-4article
AJG 3
Weight
0.50

What the paper says

No abstract available.

Open paper page →

Cite this paper

https://doi.org/https://doi.org/10.1007/s10589-026-00782-4

Or copy a formatted citation

@article{ngoc2026,
  title        = {{Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant}},
  author       = {Ngoc Hoang Anh Mai et al.},
  journal      = {Computational Optimization and Applications},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.1007/s10589-026-00782-4},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.