Pages that link to "Item:Q2910880"
From MaRDI portal
The following pages link to Lower Bounds for Polynomials Using Geometric Programming (Q2910880):
Displaying 11 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)
- Lower bounds on the global minimum of a polynomial (Q461443) (← 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)
- 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)
