Pages that link to "Item:Q2805707"

The following pages link to Lower bounds for polynomials with simplex Newton polytopes based on geometric programming (Q2805707):

Displaying 19 items.

• Amoebas, nonnegative polynomials and sums of squares supported on circuits (Q268411) (← links)
• Lower bounds on the global minimum of a polynomial (Q461443) (← links)
• Initial steps in the classification of maximal mediated sets (Q820977) (← links)
• An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming (Q1994127) (← links)
• Real zeros of SONC polynomials (Q1996073) (← links)
• The dual cone of sums of non-negative circuit polynomials (Q2035029) (← links)
• Newton polytopes and relative entropy optimization (Q2067684) (← links)
• Duality of sum of nonnegative circuit polynomials and optimal SONC bounds (Q2156369) (← links)
• SONC optimization and exact nonnegativity certificates via second-order cone programming (Q2674014) (← links)
• Lower bounds for polynomials using geometric programming (Q2910880) (← links)
• (Q3035143) (← links)
• Approximating Nonnegative Polynomials via Spectral Sparsification (Q4629345) (← links)
• Nonnegative Polynomials and Circuit Polynomials (Q5073707) (← links)
• Symmetry Reduction in AM/GM-Based Optimization (Q5080501) (← links)
• Parameter Region for Multistationarity in \({\boldsymbol{n-}}\)Site Phosphorylation Networks (Q6132790) (← links)
• Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 (Q6170529) (← links)
• Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets (Q6561376) (← links)
• Symmetric SAGE and SONC forms, exactness and quantitative gaps (Q6615415) (← links)
• On minimal extended representations of generalized power cones (Q6622743) (← links)