Pages that link to "Item:Q2910880"

The following pages link to Lower bounds for polynomials using geometric programming (Q2910880):

Displaying 21 items.

• Amoebas, nonnegative polynomials and sums of squares supported on circuits (Q268411) (← links)
• A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure (Q274079) (← links)
• Sufficient conditions for a real polynomial to be a sum of squares of polynomials (Q309665) (← links)
• Lower bounds on the global minimum of a polynomial (Q461443) (← links)
• On sums of squares of \(K\)-nomials (Q1979337) (← links)
• An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming (Q1994127) (← links)
• A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
• Newton polytopes and relative entropy optimization (Q2067684) (← links)
• Duality of sum of nonnegative circuit polynomials and optimal SONC bounds (Q2156369) (← links)
• Minkowski's inequality and sums of squares (Q2440563) (← links)
• Sums of Squares of Polynomials (Q2757515) (← links)
• Lower bounds for polynomials with simplex Newton polytopes based on geometric programming (Q2805707) (← links)
• Relative entropy relaxations for signomial optimization (Q2805708) (← links)
• Perturbed sums-of-squares theorem for polynomial optimization and its applications (Q2811486) (← links)
• (Q3035143) (← links)
• (Q3748074) (← links)
• TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity (Q5148403) (← links)
• A Positivstellensatz for Sums of Nonnegative Circuit Polynomials (Q5369248) (← links)
• Lower Bounds for Geometrical and Physical Problems (Q5691291) (← links)
• Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization (Q5742692) (← links)
• Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets (Q6561376) (← links)