Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming (Q2805707): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: POEM / rank | |||
Normal rank | |||
Revision as of 22:01, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming |
scientific article |
Statements
Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming (English)
0 references
13 May 2016
0 references
geometric programming
0 references
lower bound
0 references
nonnegative polynomial
0 references
semidefinite programming
0 references
simplex
0 references
sparsity
0 references
sum of nonnegative circuit polynomials
0 references
sum of squares
0 references
