Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming (Q2805707): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962954083 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1402.6185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tutorial on geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Optimization and Convex Algebraic Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of membership problems for the completely positive cone and its dual / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive semidefinite diagonal minus tail forms are sums of squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Polynomials Using Geometric Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: GloptiPoly 3: moments, optimization and semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amoebas, nonnegative polynomials and sums of squares supported on circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for a real polynomial to be a sum of squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forms derived from the arithmetic-geometric inequality / rank
 
Normal rank

Latest revision as of 23:06, 11 July 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
    0 references
    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
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references